/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:08:27,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:08:27,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:08:27,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:08:27,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:08:27,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:08:27,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:08:27,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:08:27,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:08:27,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:08:27,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:08:27,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:08:27,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:08:27,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:08:27,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:08:27,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:08:27,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:08:27,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:08:27,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:08:27,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:08:27,848 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:08:27,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:08:27,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:08:27,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:08:27,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:08:27,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:08:27,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:08:27,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:08:27,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:08:27,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:08:27,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:08:27,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:08:27,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:08:27,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:08:27,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:08:27,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:08:27,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:08:27,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:08:27,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:08:27,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:08:27,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:08:27,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:08:27,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:08:27,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:08:27,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:08:27,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:08:27,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:08:27,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:08:27,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:08:27,893 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:08:27,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:08:27,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:08:27,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:08:27,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:08:27,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:08:27,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:08:27,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:08:27,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:08:27,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:08:27,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:08:27,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:08:27,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:08:27,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:08:27,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:08:27,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:08:27,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:08:27,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:08:27,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:08:27,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:08:27,896 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:08:27,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:08:27,897 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:08:27,897 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-07 23:08:28,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:08:28,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:08:28,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:08:28,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:08:28,114 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:08:28,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2022-04-07 23:08:28,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f920226/6e5acc96778e4018818d1bc4bceac7bc/FLAG69f0e1f68 [2022-04-07 23:08:28,472 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:08:28,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c [2022-04-07 23:08:28,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f920226/6e5acc96778e4018818d1bc4bceac7bc/FLAG69f0e1f68 [2022-04-07 23:08:28,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2f920226/6e5acc96778e4018818d1bc4bceac7bc [2022-04-07 23:08:28,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:08:28,919 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:08:28,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:08:28,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:08:28,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:08:28,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:08:28" (1/1) ... [2022-04-07 23:08:28,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0befd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:28, skipping insertion in model container [2022-04-07 23:08:28,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:08:28" (1/1) ... [2022-04-07 23:08:28,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:08:28,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:08:29,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c[318,331] [2022-04-07 23:08:29,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:08:29,089 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:08:29,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_8.c[318,331] [2022-04-07 23:08:29,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:08:29,113 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:08:29,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29 WrapperNode [2022-04-07 23:08:29,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:08:29,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:08:29,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:08:29,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:08:29,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29" (1/1) ... [2022-04-07 23:08:29,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29" (1/1) ... [2022-04-07 23:08:29,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29" (1/1) ... [2022-04-07 23:08:29,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29" (1/1) ... [2022-04-07 23:08:29,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29" (1/1) ... [2022-04-07 23:08:29,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29" (1/1) ... [2022-04-07 23:08:29,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29" (1/1) ... [2022-04-07 23:08:29,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:08:29,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:08:29,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:08:29,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:08:29,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29" (1/1) ... [2022-04-07 23:08:29,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:08:29,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:08:29,181 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-07 23:08:29,190 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-07 23:08:29,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:08:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:08:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:08:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:08:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:08:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:08:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:08:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:08:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:08:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:08:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:08:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:08:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:08:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:08:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:08:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:08:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:08:29,269 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:08:29,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:08:29,358 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:08:29,364 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:08:29,364 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:08:29,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:08:29 BoogieIcfgContainer [2022-04-07 23:08:29,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:08:29,366 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:08:29,366 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:08:29,369 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:08:29,372 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:08:29" (1/1) ... [2022-04-07 23:08:29,373 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:08:29,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:08:29 BasicIcfg [2022-04-07 23:08:29,390 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:08:29,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:08:29,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:08:29,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:08:29,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:08:28" (1/4) ... [2022-04-07 23:08:29,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7104696a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:08:29, skipping insertion in model container [2022-04-07 23:08:29,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:08:29" (2/4) ... [2022-04-07 23:08:29,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7104696a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:08:29, skipping insertion in model container [2022-04-07 23:08:29,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:08:29" (3/4) ... [2022-04-07 23:08:29,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7104696a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:08:29, skipping insertion in model container [2022-04-07 23:08:29,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:08:29" (4/4) ... [2022-04-07 23:08:29,397 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.cqvasr [2022-04-07 23:08:29,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:08:29,401 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:08:29,437 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:08:29,443 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 23:08:29,443 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:08:29,458 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-07 23:08:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 23:08:29,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:08:29,462 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:08:29,462 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:08:29,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:08:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-04-07 23:08:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:08:29,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744296806] [2022-04-07 23:08:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:08:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:08:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:29,624 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 (= (select |v_#length_1| 2) 17) (= 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_#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-07 23:08:29,624 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-07 23:08:29,625 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-07 23:08:29,627 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-07 23:08:29,627 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 (= (select |v_#length_1| 2) 17) (= 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_#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-07 23:08:29,627 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-07 23:08:29,628 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-07 23:08:29,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:08:29,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [51] mainENTRY-->L11-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-07 23:08:29,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [53] L11-2-->L11-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:08:29,629 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {25#false} is VALID [2022-04-07 23:08:29,630 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-07 23:08:29,630 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-07 23:08:29,630 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-07 23:08:29,631 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-07 23:08:29,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:08:29,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744296806] [2022-04-07 23:08:29,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744296806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:08:29,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:08:29,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:08:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79521691] [2022-04-07 23:08:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:08:29,639 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-07 23:08:29,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:08:29,642 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-07 23:08:29,657 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-07 23:08:29,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:08:29,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:08:29,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:08:29,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:08:29,678 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-07 23:08:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:29,738 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-07 23:08:29,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:08:29,739 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-07 23:08:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:08:29,740 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-07 23:08:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-07 23:08:29,746 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-07 23:08:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-07 23:08:29,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-07 23:08:29,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:29,800 INFO L225 Difference]: With dead ends: 33 [2022-04-07 23:08:29,800 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 23:08:29,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:08:29,805 INFO L913 BasicCegarLoop]: 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-07 23:08:29,806 INFO L914 BasicCegarLoop]: 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-07 23:08:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 23:08:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 23:08:29,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:08:29,846 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-07 23:08:29,846 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-07 23:08:29,846 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-07 23:08:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:29,849 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 23:08:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 23:08:29,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:29,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:29,851 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-07 23:08:29,852 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-07 23:08:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:29,857 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 23:08:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 23:08:29,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:29,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:29,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:08:29,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:08:29,859 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-07 23:08:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-07 23:08:29,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-07 23:08:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:08:29,864 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-07 23:08:29,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-07 23:08:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 23:08:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 23:08:29,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:08:29,871 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:08:29,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:08:29,872 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:08:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:08:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-04-07 23:08:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:08:29,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224438318] [2022-04-07 23:08:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:29,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:08:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:30,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:08:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:30,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {123#true} is VALID [2022-04-07 23:08:30,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:08:30,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:08:30,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:08:30,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {123#true} is VALID [2022-04-07 23:08:30,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:08:30,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:08:30,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:08:30,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [51] mainENTRY-->L11-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] {128#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:30,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-07 23:08:30,076 INFO L272 TraceCheckUtils]: 7: Hoare triple {124#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {124#false} is VALID [2022-04-07 23:08:30,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#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] {124#false} is VALID [2022-04-07 23:08:30,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#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[] {124#false} is VALID [2022-04-07 23:08:30,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {124#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-07 23:08:30,077 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-07 23:08:30,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:08:30,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224438318] [2022-04-07 23:08:30,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224438318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:08:30,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:08:30,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 23:08:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594646496] [2022-04-07 23:08:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:08:30,080 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-07 23:08:30,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:08:30,081 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-07 23:08:30,094 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-07 23:08:30,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 23:08:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:08:30,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 23:08:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 23:08:30,096 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-07 23:08:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:30,200 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-07 23:08:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 23:08:30,200 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-07 23:08:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:08:30,201 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-07 23:08:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-07 23:08:30,204 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-07 23:08:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-07 23:08:30,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-07 23:08:30,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:30,240 INFO L225 Difference]: With dead ends: 25 [2022-04-07 23:08:30,240 INFO L226 Difference]: Without dead ends: 17 [2022-04-07 23:08:30,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:08:30,246 INFO L913 BasicCegarLoop]: 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-07 23:08:30,246 INFO L914 BasicCegarLoop]: 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-07 23:08:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-07 23:08:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-07 23:08:30,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:08:30,253 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-07 23:08:30,254 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-07 23:08:30,254 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-07 23:08:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:30,256 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 23:08:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-07 23:08:30,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:30,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:30,257 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-07 23:08:30,258 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-07 23:08:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:30,259 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 23:08:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-07 23:08:30,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:30,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:30,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:08:30,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:08:30,261 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-07 23:08:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-07 23:08:30,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-07 23:08:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:08:30,262 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-07 23:08:30,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-07 23:08:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-07 23:08:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 23:08:30,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:08:30,264 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:08:30,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 23:08:30,264 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:08:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:08:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1516694440, now seen corresponding path program 1 times [2022-04-07 23:08:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:08:30,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556488834] [2022-04-07 23:08:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:08:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:30,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:08:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:30,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {228#true} is VALID [2022-04-07 23:08:30,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:08:30,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {228#true} is VALID [2022-04-07 23:08:30,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [51] mainENTRY-->L11-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] {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:30,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {234#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:30,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {234#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:30,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {235#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-07 23:08:30,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-07 23:08:30,424 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {229#false} is VALID [2022-04-07 23:08:30,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#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] {229#false} is VALID [2022-04-07 23:08:30,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#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[] {229#false} is VALID [2022-04-07 23:08:30,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-07 23:08:30,426 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-07 23:08:30,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:08:30,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556488834] [2022-04-07 23:08:30,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556488834] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:08:30,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976815204] [2022-04-07 23:08:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:30,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:08:30,428 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-07 23:08:30,429 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-07 23:08:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:30,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 23:08:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:30,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:08:30,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {228#true} is VALID [2022-04-07 23:08:30,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [51] mainENTRY-->L11-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] {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:30,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:30,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:30,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {264#(and (= (+ (- 1) main_~x~0) 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:30,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(and (= (+ (- 1) main_~x~0) 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-07 23:08:30,825 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {229#false} is VALID [2022-04-07 23:08:30,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#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] {229#false} is VALID [2022-04-07 23:08:30,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#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[] {229#false} is VALID [2022-04-07 23:08:30,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-07 23:08:30,826 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-07 23:08:30,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:08:30,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-07 23:08:30,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#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[] {229#false} is VALID [2022-04-07 23:08:30,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#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] {229#false} is VALID [2022-04-07 23:08:30,942 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {229#false} is VALID [2022-04-07 23:08:30,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-07 23:08:30,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {292#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:30,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:30,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:30,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [51] mainENTRY-->L11-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] {296#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:30,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {228#true} is VALID [2022-04-07 23:08:30,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-07 23:08:30,946 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-07 23:08:30,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976815204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:08:30,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:08:30,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-04-07 23:08:30,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916149997] [2022-04-07 23:08:30,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:08:30,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 23:08:30,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:08:30,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:30,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:30,978 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 23:08:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:08:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 23:08:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-07 23:08:30,979 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:31,203 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-07 23:08:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 23:08:31,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 23:08:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:08:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-07 23:08:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-07 23:08:31,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-07 23:08:31,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:31,248 INFO L225 Difference]: With dead ends: 32 [2022-04-07 23:08:31,248 INFO L226 Difference]: Without dead ends: 24 [2022-04-07 23:08:31,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-04-07 23:08:31,250 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:08:31,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:08:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-07 23:08:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-07 23:08:31,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:08:31,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:31,259 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:31,259 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:31,260 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 23:08:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 23:08:31,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:31,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:31,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-07 23:08:31,261 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-07 23:08:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:31,263 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 23:08:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 23:08:31,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:31,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:31,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:08:31,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:08:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-07 23:08:31,264 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-07 23:08:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:08:31,265 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-07 23:08:31,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-07 23:08:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 23:08:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 23:08:31,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:08:31,266 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:08:31,292 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-07 23:08:31,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:31,486 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:08:31,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:08:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1579293370, now seen corresponding path program 1 times [2022-04-07 23:08:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:08:31,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438455485] [2022-04-07 23:08:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:08:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:08:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:31,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {460#true} is VALID [2022-04-07 23:08:31,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:31,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:31,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:08:31,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {460#true} is VALID [2022-04-07 23:08:31,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:31,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:31,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:31,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} [51] mainENTRY-->L11-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] {465#(= main_~x~0 0)} is VALID [2022-04-07 23:08:31,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {465#(= main_~x~0 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {465#(= main_~x~0 0)} is VALID [2022-04-07 23:08:31,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(= main_~x~0 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {465#(= main_~x~0 0)} is VALID [2022-04-07 23:08:31,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#(= main_~x~0 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:31,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:31,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:31,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {467#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:31,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {467#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:31,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {467#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {461#false} is VALID [2022-04-07 23:08:31,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {461#false} is VALID [2022-04-07 23:08:31,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 23:08:31,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {461#false} is VALID [2022-04-07 23:08:31,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {461#false} is VALID [2022-04-07 23:08:31,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {461#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 23:08:31,619 INFO L272 TraceCheckUtils]: 19: Hoare triple {461#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {461#false} is VALID [2022-04-07 23:08:31,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {461#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] {461#false} is VALID [2022-04-07 23:08:31,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {461#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[] {461#false} is VALID [2022-04-07 23:08:31,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 23:08:31,620 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-07 23:08:31,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:08:31,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438455485] [2022-04-07 23:08:31,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438455485] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:08:31,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224941322] [2022-04-07 23:08:31,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:31,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:31,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:08:31,622 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-07 23:08:31,623 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-07 23:08:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:31,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 23:08:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:31,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:08:31,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:31,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {460#true} is VALID [2022-04-07 23:08:31,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:31,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:31,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:31,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} [51] mainENTRY-->L11-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] {465#(= main_~x~0 0)} is VALID [2022-04-07 23:08:31,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {465#(= main_~x~0 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {465#(= main_~x~0 0)} is VALID [2022-04-07 23:08:31,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(= main_~x~0 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {465#(= main_~x~0 0)} is VALID [2022-04-07 23:08:31,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#(= main_~x~0 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:31,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:31,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:31,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:31,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:31,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {461#false} is VALID [2022-04-07 23:08:31,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {461#false} is VALID [2022-04-07 23:08:31,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 23:08:31,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {461#false} is VALID [2022-04-07 23:08:31,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {461#false} is VALID [2022-04-07 23:08:31,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {461#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 23:08:31,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {461#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {461#false} is VALID [2022-04-07 23:08:31,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {461#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] {461#false} is VALID [2022-04-07 23:08:31,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {461#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[] {461#false} is VALID [2022-04-07 23:08:31,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 23:08:31,998 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-07 23:08:31,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:08:32,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 23:08:32,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {461#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[] {461#false} is VALID [2022-04-07 23:08:32,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {461#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] {461#false} is VALID [2022-04-07 23:08:32,293 INFO L272 TraceCheckUtils]: 19: Hoare triple {461#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {461#false} is VALID [2022-04-07 23:08:32,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {461#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 23:08:32,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {461#false} is VALID [2022-04-07 23:08:32,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {461#false} is VALID [2022-04-07 23:08:32,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-07 23:08:32,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {461#false} is VALID [2022-04-07 23:08:32,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {566#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {461#false} is VALID [2022-04-07 23:08:32,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {570#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {566#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 23:08:32,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {570#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-07 23:08:32,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-07 23:08:32,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-07 23:08:32,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {574#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-07 23:08:32,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-07 23:08:32,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-07 23:08:32,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} [51] mainENTRY-->L11-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] {584#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-07 23:08:32,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:32,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:32,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:32,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {460#true} is VALID [2022-04-07 23:08:32,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-07 23:08:32,303 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-07 23:08:32,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224941322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:08:32,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:08:32,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-07 23:08:32,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095372461] [2022-04-07 23:08:32,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:08:32,305 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-07 23:08:32,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:08:32,305 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-07 23:08:32,347 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-07 23:08:32,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 23:08:32,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:08:32,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 23:08:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-07 23:08:32,349 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:32,715 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-07 23:08:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 23:08:32,715 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-07 23:08:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:08:32,715 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-07 23:08:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-07 23:08:32,717 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-07 23:08:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-07 23:08:32,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-07 23:08:32,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:32,769 INFO L225 Difference]: With dead ends: 44 [2022-04-07 23:08:32,769 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 23:08:32,769 INFO L912 BasicCegarLoop]: 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-07 23:08:32,770 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:08:32,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:08:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 23:08:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-07 23:08:32,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:08:32,799 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-07 23:08:32,799 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-07 23:08:32,799 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-07 23:08:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:32,801 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-07 23:08:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-07 23:08:32,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:32,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:32,802 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-07 23:08:32,802 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-07 23:08:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:32,803 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-07 23:08:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-07 23:08:32,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:32,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:32,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:08:32,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:08:32,804 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-07 23:08:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-07 23:08:32,805 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-04-07 23:08:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:08:32,805 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-07 23:08:32,806 INFO L479 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-07 23:08:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-07 23:08:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 23:08:32,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:08:32,806 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:08:32,823 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-07 23:08:33,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 23:08:33,010 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:08:33,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:08:33,011 INFO L85 PathProgramCache]: Analyzing trace with hash -888303194, now seen corresponding path program 2 times [2022-04-07 23:08:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:08:33,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877644537] [2022-04-07 23:08:33,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:08:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:33,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:08:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:33,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {809#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {798#true} is VALID [2022-04-07 23:08:33,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {798#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {798#true} {798#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {798#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:08:33,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {798#true} is VALID [2022-04-07 23:08:33,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {798#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {798#true} {798#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {798#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {798#true} [51] mainENTRY-->L11-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] {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {804#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {804#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {804#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {804#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {806#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:33,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {807#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {808#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} is VALID [2022-04-07 23:08:33,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {808#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {799#false} is VALID [2022-04-07 23:08:33,219 INFO L272 TraceCheckUtils]: 19: Hoare triple {799#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {799#false} is VALID [2022-04-07 23:08:33,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {799#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] {799#false} is VALID [2022-04-07 23:08:33,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {799#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[] {799#false} is VALID [2022-04-07 23:08:33,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {799#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799#false} is VALID [2022-04-07 23:08:33,220 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-07 23:08:33,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:08:33,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877644537] [2022-04-07 23:08:33,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877644537] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:08:33,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200093476] [2022-04-07 23:08:33,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 23:08:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:08:33,223 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-07 23:08:33,246 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-07 23:08:33,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 23:08:33,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:08:33,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 23:08:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:33,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:08:33,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {798#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {798#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {798#true} is VALID [2022-04-07 23:08:33,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {798#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {798#true} {798#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {798#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {798#true} [51] mainENTRY-->L11-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] {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {803#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#(and (= main_~x~0 1) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} is VALID [2022-04-07 23:08:33,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} is VALID [2022-04-07 23:08:33,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} is VALID [2022-04-07 23:08:33,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {847#(and (<= 10000000 main_~y~0) (<= main_~y~0 10000000) (= main_~x~0 2))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#(and (= main_~x~0 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {867#(and (= (+ (- 1) main_~x~0) 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:33,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#(and (= (+ (- 1) main_~x~0) 3) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {799#false} is VALID [2022-04-07 23:08:33,681 INFO L272 TraceCheckUtils]: 19: Hoare triple {799#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {799#false} is VALID [2022-04-07 23:08:33,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {799#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] {799#false} is VALID [2022-04-07 23:08:33,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {799#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[] {799#false} is VALID [2022-04-07 23:08:33,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {799#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799#false} is VALID [2022-04-07 23:08:33,681 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-07 23:08:33,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:08:33,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {799#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799#false} is VALID [2022-04-07 23:08:33,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {799#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[] {799#false} is VALID [2022-04-07 23:08:33,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {799#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] {799#false} is VALID [2022-04-07 23:08:33,868 INFO L272 TraceCheckUtils]: 19: Hoare triple {799#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {799#false} is VALID [2022-04-07 23:08:33,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {895#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {799#false} is VALID [2022-04-07 23:08:33,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {895#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {899#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {909#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {919#(< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {798#true} [51] mainENTRY-->L11-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] {929#(< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:33,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {798#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {798#true} {798#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {798#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {798#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {798#true} is VALID [2022-04-07 23:08:33,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {798#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {798#true} is VALID [2022-04-07 23:08:33,882 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-07 23:08:33,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200093476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:08:33,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:08:33,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2022-04-07 23:08:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797304360] [2022-04-07 23:08:33,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:08:33,883 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 23:08:33,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:08:33,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:33,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:33,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 23:08:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:08:33,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 23:08:33,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-07 23:08:33,936 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:34,713 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-07 23:08:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 23:08:34,713 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 23:08:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:08:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-07 23:08:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-07 23:08:34,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-07 23:08:34,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:34,782 INFO L225 Difference]: With dead ends: 47 [2022-04-07 23:08:34,791 INFO L226 Difference]: Without dead ends: 42 [2022-04-07 23:08:34,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2022-04-07 23:08:34,792 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:08:34,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 38 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 23:08:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-07 23:08:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-07 23:08:34,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:08:34,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:34,822 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:34,822 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:34,824 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-07 23:08:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-07 23:08:34,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:34,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:34,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-07 23:08:34,825 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-07 23:08:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:34,827 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-07 23:08:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-07 23:08:34,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:34,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:34,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:08:34,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:08:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-07 23:08:34,829 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 23 [2022-04-07 23:08:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:08:34,829 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-07 23:08:34,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-07 23:08:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 23:08:34,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:08:34,830 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:08:34,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 23:08:35,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:35,040 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:08:35,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:08:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash -443899610, now seen corresponding path program 2 times [2022-04-07 23:08:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:08:35,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719113438] [2022-04-07 23:08:35,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:35,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:08:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:35,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:08:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:35,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {1197#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {1185#true} is VALID [2022-04-07 23:08:35,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1185#true} {1185#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {1185#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:08:35,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {1185#true} is VALID [2022-04-07 23:08:35,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {1185#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1185#true} {1185#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {1185#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#true} [51] mainENTRY-->L11-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] {1190#(= main_~x~0 0)} is VALID [2022-04-07 23:08:35,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {1190#(= main_~x~0 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1190#(= main_~x~0 0)} is VALID [2022-04-07 23:08:35,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {1190#(= main_~x~0 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1190#(= main_~x~0 0)} is VALID [2022-04-07 23:08:35,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {1190#(= main_~x~0 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:35,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:35,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:35,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:35,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:35,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:35,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:35,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:35,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:35,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:35,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:35,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:35,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:35,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:35,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:35,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1196#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:35,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {1196#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1196#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:35,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {1196#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {1186#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {1186#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {1186#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,251 INFO L272 TraceCheckUtils]: 37: Hoare triple {1186#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {1186#false} is VALID [2022-04-07 23:08:35,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {1186#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] {1186#false} is VALID [2022-04-07 23:08:35,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {1186#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[] {1186#false} is VALID [2022-04-07 23:08:35,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {1186#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 23:08:35,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:08:35,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719113438] [2022-04-07 23:08:35,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719113438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:08:35,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740829605] [2022-04-07 23:08:35,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 23:08:35,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:35,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:08:35,254 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-07 23:08:35,279 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-07 23:08:35,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 23:08:35,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:08:35,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 23:08:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:35,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:08:35,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {1185#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {1185#true} is VALID [2022-04-07 23:08:35,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {1185#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1185#true} {1185#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {1185#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#true} [51] mainENTRY-->L11-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] {1190#(= main_~x~0 0)} is VALID [2022-04-07 23:08:35,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {1190#(= main_~x~0 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1190#(= main_~x~0 0)} is VALID [2022-04-07 23:08:35,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1190#(= main_~x~0 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1190#(= main_~x~0 0)} is VALID [2022-04-07 23:08:35,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {1190#(= main_~x~0 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:35,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:35,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:35,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {1191#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:35,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:35,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:35,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:35,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:35,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:35,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {1193#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:35,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:35,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:35,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {1194#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:35,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:35,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:35,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {1195#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1270#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:35,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {1270#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1270#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:35,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {1270#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {1186#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {1186#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {1186#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,699 INFO L272 TraceCheckUtils]: 37: Hoare triple {1186#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {1186#false} is VALID [2022-04-07 23:08:35,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {1186#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] {1186#false} is VALID [2022-04-07 23:08:35,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {1186#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[] {1186#false} is VALID [2022-04-07 23:08:35,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {1186#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 23:08:35,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:08:35,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {1186#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {1186#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[] {1186#false} is VALID [2022-04-07 23:08:35,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {1186#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] {1186#false} is VALID [2022-04-07 23:08:35,949 INFO L272 TraceCheckUtils]: 37: Hoare triple {1186#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {1186#false} is VALID [2022-04-07 23:08:35,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {1186#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {1186#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {1186#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1186#false} is VALID [2022-04-07 23:08:35,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {1186#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1186#false} is VALID [2022-04-07 23:08:35,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {1186#false} is VALID [2022-04-07 23:08:35,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#(not (<= 5000000 (mod main_~x~0 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1367#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 23:08:35,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1367#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 23:08:35,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-07 23:08:35,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-07 23:08:35,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1374#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-07 23:08:35,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-07 23:08:35,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-07 23:08:35,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1384#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-07 23:08:35,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-07 23:08:35,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-07 23:08:35,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1394#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-07 23:08:35,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-07 23:08:35,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-07 23:08:35,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1404#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-07 23:08:35,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-07 23:08:35,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-07 23:08:35,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1414#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-07 23:08:35,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-07 23:08:35,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-07 23:08:35,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#true} [51] mainENTRY-->L11-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] {1424#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-07 23:08:35,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {1185#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1185#true} {1185#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {1185#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {1185#true} is VALID [2022-04-07 23:08:35,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {1185#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1185#true} is VALID [2022-04-07 23:08:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 23:08:35,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740829605] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:08:35,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:08:35,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-07 23:08:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438331339] [2022-04-07 23:08:35,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:08:35,961 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-07 23:08:35,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:08:35,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:36,017 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-07 23:08:36,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 23:08:36,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:08:36,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 23:08:36,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-04-07 23:08:36,018 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:37,291 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-04-07 23:08:37,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 23:08:37,292 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-07 23:08:37,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:08:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-07 23:08:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-07 23:08:37,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-04-07 23:08:37,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:37,427 INFO L225 Difference]: With dead ends: 76 [2022-04-07 23:08:37,427 INFO L226 Difference]: Without dead ends: 60 [2022-04-07 23:08:37,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=299, Invalid=693, Unknown=0, NotChecked=0, Total=992 [2022-04-07 23:08:37,428 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:08:37,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 58 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 23:08:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-07 23:08:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2022-04-07 23:08:37,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:08:37,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:37,470 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:37,470 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:37,473 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-07 23:08:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-07 23:08:37,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:37,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:37,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-07 23:08:37,474 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-07 23:08:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:37,476 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-07 23:08:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-07 23:08:37,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:37,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:37,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:08:37,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:08:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-04-07 23:08:37,478 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 41 [2022-04-07 23:08:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:08:37,478 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-04-07 23:08:37,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:37,479 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-07 23:08:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 23:08:37,479 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:08:37,479 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:08:37,503 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-07 23:08:37,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:37,697 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:08:37,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:08:37,697 INFO L85 PathProgramCache]: Analyzing trace with hash -556846618, now seen corresponding path program 3 times [2022-04-07 23:08:37,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:08:37,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013972628] [2022-04-07 23:08:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:08:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:08:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:38,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {1799#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {1782#true} is VALID [2022-04-07 23:08:38,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {1782#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-07 23:08:38,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1782#true} {1782#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-07 23:08:38,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {1782#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:08:38,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {1799#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {1782#true} is VALID [2022-04-07 23:08:38,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-07 23:08:38,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1782#true} {1782#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-07 23:08:38,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {1782#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-07 23:08:38,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {1782#true} [51] mainENTRY-->L11-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] {1787#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-07 23:08:38,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {1787#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1788#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {1788#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1788#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {1788#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {1789#(and (<= 1 main_~x~0) (<= (+ 9999999 main_~x~0) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {1790#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= 2 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {1791#(and (<= (+ main_~x~0 9999997) main_~y~0) (<= 3 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {1792#(and (<= (+ 9999996 main_~x~0) main_~y~0) (<= 4 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#(and (<= (+ main_~x~0 9999995) main_~y~0) (<= 5 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} is VALID [2022-04-07 23:08:38,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} is VALID [2022-04-07 23:08:38,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} is VALID [2022-04-07 23:08:38,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {1794#(and (<= 6 main_~x~0) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~x~0 9999994) main_~y~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:38,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:38,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:38,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {1795#(and (<= (+ main_~x~0 9999993) main_~y~0) (<= (div main_~y~0 4294967296) 0) (<= 7 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {1796#(and (<= (+ 9999992 main_~x~0) main_~y~0) (<= 8 main_~x~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-07 23:08:38,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {1797#(and (<= 9 main_~x~0) (<= (+ main_~x~0 9999991) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1798#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999990 main_~x~0) main_~y~0))} is VALID [2022-04-07 23:08:38,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999990 main_~x~0) main_~y~0))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1783#false} is VALID [2022-04-07 23:08:38,066 INFO L272 TraceCheckUtils]: 37: Hoare triple {1783#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {1783#false} is VALID [2022-04-07 23:08:38,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {1783#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] {1783#false} is VALID [2022-04-07 23:08:38,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {1783#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[] {1783#false} is VALID [2022-04-07 23:08:38,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {1783#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1783#false} is VALID [2022-04-07 23:08:38,067 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-07 23:08:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:08:38,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013972628] [2022-04-07 23:08:38,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013972628] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:08:38,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697528460] [2022-04-07 23:08:38,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 23:08:38,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:38,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:08:38,069 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-07 23:08:38,081 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-07 23:08:38,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 23:08:38,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:08:38,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 23:08:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:38,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:08:38,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {1782#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-07 23:08:38,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {1782#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {1782#true} is VALID [2022-04-07 23:08:38,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-07 23:08:38,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1782#true} {1782#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-07 23:08:38,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {1782#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#true} is VALID [2022-04-07 23:08:38,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {1782#true} [51] mainENTRY-->L11-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] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {1818#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {1818#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {1818#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {1818#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {1818#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {1818#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {1818#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1818#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:38,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1906#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-07 23:08:38,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {1906#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1910#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-07 23:08:38,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {1910#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1783#false} is VALID [2022-04-07 23:08:38,534 INFO L272 TraceCheckUtils]: 37: Hoare triple {1783#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {1783#false} is VALID [2022-04-07 23:08:38,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {1783#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] {1783#false} is VALID [2022-04-07 23:08:38,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {1783#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[] {1783#false} is VALID [2022-04-07 23:08:38,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {1783#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1783#false} is VALID [2022-04-07 23:08:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-07 23:08:38,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:08:38,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697528460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:08:38,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 23:08:38,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-07 23:08:38,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950114091] [2022-04-07 23:08:38,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:08:38,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-07 23:08:38,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:08:38,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:38,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:38,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 23:08:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:08:38,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 23:08:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-07 23:08:38,548 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:38,662 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-07 23:08:38,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:08:38,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-07 23:08:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:08:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-07 23:08:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-07 23:08:38,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-07 23:08:38,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:38,692 INFO L225 Difference]: With dead ends: 65 [2022-04-07 23:08:38,692 INFO L226 Difference]: Without dead ends: 60 [2022-04-07 23:08:38,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-04-07 23:08:38,693 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:08:38,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:08:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-07 23:08:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-07 23:08:38,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:08:38,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:38,746 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:38,746 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:38,748 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-07 23:08:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-07 23:08:38,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:38,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:38,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-07 23:08:38,749 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-07 23:08:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:38,752 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-07 23:08:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-07 23:08:38,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:38,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:38,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:08:38,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:08:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-04-07 23:08:38,754 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 41 [2022-04-07 23:08:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:08:38,755 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-04-07 23:08:38,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:38,755 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-07 23:08:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-07 23:08:38,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:08:38,757 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:08:38,781 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-07 23:08:38,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:38,979 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:08:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:08:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash -236436009, now seen corresponding path program 3 times [2022-04-07 23:08:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:08:38,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896180455] [2022-04-07 23:08:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:08:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:39,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:08:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:39,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {2235#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {2215#true} is VALID [2022-04-07 23:08:39,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:39,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2215#true} {2215#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:39,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:08:39,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {2235#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {2215#true} is VALID [2022-04-07 23:08:39,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:39,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:39,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:39,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} [51] mainENTRY-->L11-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] {2220#(= main_~x~0 0)} is VALID [2022-04-07 23:08:39,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {2220#(= main_~x~0 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2220#(= main_~x~0 0)} is VALID [2022-04-07 23:08:39,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {2220#(= main_~x~0 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2220#(= main_~x~0 0)} is VALID [2022-04-07 23:08:39,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {2220#(= main_~x~0 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:39,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:39,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:39,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:39,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:39,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:39,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:39,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:39,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:39,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:39,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:39,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:39,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:39,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:39,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:39,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:39,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:39,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:39,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:39,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:39,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:39,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:08:39,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:08:39,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:08:39,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:08:39,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:08:39,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:08:39,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:08:39,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:08:39,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:08:39,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:08:39,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:08:39,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:08:39,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:08:39,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:08:39,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:08:39,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:08:39,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:08:39,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:08:39,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {2233#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2234#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:08:39,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {2234#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2234#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:08:39,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {2234#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {2216#false} is VALID [2022-04-07 23:08:39,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {2216#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2216#false} is VALID [2022-04-07 23:08:39,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {2216#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-07 23:08:39,308 INFO L272 TraceCheckUtils]: 52: Hoare triple {2216#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {2216#false} is VALID [2022-04-07 23:08:39,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {2216#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] {2216#false} is VALID [2022-04-07 23:08:39,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#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[] {2216#false} is VALID [2022-04-07 23:08:39,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-07 23:08:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:08:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:08:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896180455] [2022-04-07 23:08:39,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896180455] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:08:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597780819] [2022-04-07 23:08:39,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 23:08:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:39,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:08:39,311 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-07 23:08:39,311 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-07 23:08:39,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 23:08:39,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:08:39,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 23:08:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:39,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:08:39,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:39,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {2215#true} is VALID [2022-04-07 23:08:39,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:39,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:39,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:39,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} [51] mainENTRY-->L11-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] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {2254#(= main_~y~0 10000000)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {2254#(= main_~y~0 10000000)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2254#(= main_~y~0 10000000)} is VALID [2022-04-07 23:08:39,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {2254#(= main_~y~0 10000000)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2378#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-07 23:08:39,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {2378#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-07 23:08:39,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-07 23:08:39,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-07 23:08:39,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {2382#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2392#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (= main_~y~0 10000000))} is VALID [2022-04-07 23:08:39,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {2392#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (= main_~y~0 10000000))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-07 23:08:39,833 INFO L272 TraceCheckUtils]: 52: Hoare triple {2216#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {2216#false} is VALID [2022-04-07 23:08:39,833 INFO L290 TraceCheckUtils]: 53: Hoare triple {2216#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] {2216#false} is VALID [2022-04-07 23:08:39,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#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[] {2216#false} is VALID [2022-04-07 23:08:39,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-07 23:08:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-04-07 23:08:39,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:08:40,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-07 23:08:40,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#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[] {2216#false} is VALID [2022-04-07 23:08:40,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {2216#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] {2216#false} is VALID [2022-04-07 23:08:40,362 INFO L272 TraceCheckUtils]: 52: Hoare triple {2216#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {2216#false} is VALID [2022-04-07 23:08:40,363 INFO L290 TraceCheckUtils]: 51: Hoare triple {2420#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-07 23:08:40,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2420#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:40,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:40,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:40,365 INFO L290 TraceCheckUtils]: 47: Hoare triple {2434#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2424#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:40,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2434#(< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 23:08:40,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} [51] mainENTRY-->L11-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] {2438#(<= (div (+ (mod main_~y~0 4294967296) (- 5000002)) (- 4294967296)) 0)} is VALID [2022-04-07 23:08:40,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:40,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:40,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:40,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {2215#true} is VALID [2022-04-07 23:08:40,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-07 23:08:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-04-07 23:08:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597780819] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:08:40,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:08:40,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 26 [2022-04-07 23:08:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364701062] [2022-04-07 23:08:40,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:08:40,382 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-07 23:08:40,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:08:40,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:40,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:40,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 23:08:40,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:08:40,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 23:08:40,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-04-07 23:08:40,452 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:42,834 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-04-07 23:08:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-07 23:08:42,834 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-07 23:08:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:08:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 100 transitions. [2022-04-07 23:08:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 100 transitions. [2022-04-07 23:08:42,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 100 transitions. [2022-04-07 23:08:42,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:42,971 INFO L225 Difference]: With dead ends: 89 [2022-04-07 23:08:42,971 INFO L226 Difference]: Without dead ends: 79 [2022-04-07 23:08:42,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=547, Invalid=2003, Unknown=0, NotChecked=0, Total=2550 [2022-04-07 23:08:42,973 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 230 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 23:08:42,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 92 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 23:08:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-07 23:08:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-04-07 23:08:43,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:08:43,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:43,046 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:43,048 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:43,052 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-04-07 23:08:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-07 23:08:43,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:43,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:43,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-07 23:08:43,054 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-07 23:08:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:08:43,056 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-04-07 23:08:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-07 23:08:43,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:08:43,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:08:43,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:08:43,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:08:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-07 23:08:43,064 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 56 [2022-04-07 23:08:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:08:43,065 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-07 23:08:43,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-07 23:08:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-07 23:08:43,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:08:43,065 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:08:43,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 23:08:43,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:43,266 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:08:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:08:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1430063529, now seen corresponding path program 4 times [2022-04-07 23:08:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:08:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110721] [2022-04-07 23:08:43,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:08:43,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:08:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:08:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:43,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {3034#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {3012#true} is VALID [2022-04-07 23:08:43,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {3012#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:43,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3012#true} {3012#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:43,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {3012#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:08:43,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {3034#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {3012#true} is VALID [2022-04-07 23:08:43,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {3012#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:43,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3012#true} {3012#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:43,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {3012#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:43,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {3012#true} [51] mainENTRY-->L11-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] {3017#(= main_~x~0 0)} is VALID [2022-04-07 23:08:43,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {3017#(= main_~x~0 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3017#(= main_~x~0 0)} is VALID [2022-04-07 23:08:43,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {3017#(= main_~x~0 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3017#(= main_~x~0 0)} is VALID [2022-04-07 23:08:43,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {3017#(= main_~x~0 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:43,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:43,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:43,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:43,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:43,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:43,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:43,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:43,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:43,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:43,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:43,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:43,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:43,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:43,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:43,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:43,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:43,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:43,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:43,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:43,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:43,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:08:43,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:08:43,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:08:43,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:08:43,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:08:43,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:08:43,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:08:43,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:08:43,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:08:43,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:08:43,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:08:43,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:08:43,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:08:43,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:08:43,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:08:43,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:08:43,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:08:43,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:08:43,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:08:43,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:08:43,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:08:43,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:08:43,686 INFO L290 TraceCheckUtils]: 51: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:08:43,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:08:43,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3033#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:08:43,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {3033#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3033#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {3033#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {3013#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {3013#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {3013#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {3013#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {3013#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {3013#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {3013#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 63: Hoare triple {3013#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {3013#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3013#false} is VALID [2022-04-07 23:08:43,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {3013#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3013#false} is VALID [2022-04-07 23:08:43,689 INFO L290 TraceCheckUtils]: 66: Hoare triple {3013#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:43,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {3013#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3013#false} is VALID [2022-04-07 23:08:43,689 INFO L290 TraceCheckUtils]: 68: Hoare triple {3013#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3013#false} is VALID [2022-04-07 23:08:43,689 INFO L290 TraceCheckUtils]: 69: Hoare triple {3013#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:43,689 INFO L272 TraceCheckUtils]: 70: Hoare triple {3013#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {3013#false} is VALID [2022-04-07 23:08:43,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {3013#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] {3013#false} is VALID [2022-04-07 23:08:43,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {3013#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[] {3013#false} is VALID [2022-04-07 23:08:43,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {3013#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 233 proven. 392 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-07 23:08:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:08:43,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110721] [2022-04-07 23:08:43,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:08:43,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947339541] [2022-04-07 23:08:43,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 23:08:43,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:08:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:08:43,691 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-07 23:08:43,695 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-07 23:08:43,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 23:08:43,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:08:43,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-07 23:08:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:08:43,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:08:44,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {3012#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:44,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {3012#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {3012#true} is VALID [2022-04-07 23:08:44,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {3012#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:44,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3012#true} {3012#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:44,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {3012#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:44,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {3012#true} [51] mainENTRY-->L11-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] {3017#(= main_~x~0 0)} is VALID [2022-04-07 23:08:44,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {3017#(= main_~x~0 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3017#(= main_~x~0 0)} is VALID [2022-04-07 23:08:44,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {3017#(= main_~x~0 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3017#(= main_~x~0 0)} is VALID [2022-04-07 23:08:44,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {3017#(= main_~x~0 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:44,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:44,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:08:44,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {3018#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:44,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:44,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:08:44,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:44,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:44,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:08:44,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:44,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:44,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:08:44,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {3021#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:44,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:44,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:08:44,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {3022#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:44,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:44,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:08:44,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {3023#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:44,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:44,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:08:44,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {3024#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:08:44,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:08:44,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:08:44,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {3025#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:08:44,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:08:44,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:08:44,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {3026#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:08:44,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:08:44,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:08:44,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {3027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:08:44,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:08:44,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:08:44,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {3028#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:08:44,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:08:44,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:08:44,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {3029#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:08:44,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:08:44,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:08:44,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {3030#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:08:44,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:08:44,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:08:44,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {3031#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:08:44,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:08:44,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:08:44,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {3032#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:08:44,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:08:44,640 INFO L290 TraceCheckUtils]: 55: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:08:44,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {3197#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:08:44,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:08:44,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:08:44,643 INFO L290 TraceCheckUtils]: 59: Hoare triple {3207#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{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 18) (<= 18 main_~x~0))} is VALID [2022-04-07 23:08:44,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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 18) (<= 18 main_~x~0))} is VALID [2022-04-07 23:08:44,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 23:08:44,644 INFO L290 TraceCheckUtils]: 62: Hoare triple {3217#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:08:44,645 INFO L290 TraceCheckUtils]: 63: Hoare triple {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:08:44,645 INFO L290 TraceCheckUtils]: 64: Hoare triple {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:08:44,646 INFO L290 TraceCheckUtils]: 65: Hoare triple {3227#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3237#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 23:08:44,646 INFO L290 TraceCheckUtils]: 66: Hoare triple {3237#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3237#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 23:08:44,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {3237#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3013#false} is VALID [2022-04-07 23:08:44,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {3013#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3013#false} is VALID [2022-04-07 23:08:44,647 INFO L290 TraceCheckUtils]: 69: Hoare triple {3013#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:44,647 INFO L272 TraceCheckUtils]: 70: Hoare triple {3013#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {3013#false} is VALID [2022-04-07 23:08:44,648 INFO L290 TraceCheckUtils]: 71: Hoare triple {3013#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] {3013#false} is VALID [2022-04-07 23:08:44,648 INFO L290 TraceCheckUtils]: 72: Hoare triple {3013#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[] {3013#false} is VALID [2022-04-07 23:08:44,648 INFO L290 TraceCheckUtils]: 73: Hoare triple {3013#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:08:44,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:08:46,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {3013#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:46,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {3013#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[] {3013#false} is VALID [2022-04-07 23:08:46,202 INFO L290 TraceCheckUtils]: 71: Hoare triple {3013#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] {3013#false} is VALID [2022-04-07 23:08:46,202 INFO L272 TraceCheckUtils]: 70: Hoare triple {3013#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {3013#false} is VALID [2022-04-07 23:08:46,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {3013#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3013#false} is VALID [2022-04-07 23:08:46,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {3013#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3013#false} is VALID [2022-04-07 23:08:46,203 INFO L290 TraceCheckUtils]: 67: Hoare triple {3280#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3013#false} is VALID [2022-04-07 23:08:46,203 INFO L290 TraceCheckUtils]: 66: Hoare triple {3284#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3280#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 23:08:46,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3284#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-07 23:08:46,205 INFO L290 TraceCheckUtils]: 64: Hoare triple {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-07 23:08:46,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-07 23:08:46,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3288#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-07 23:08:46,207 INFO L290 TraceCheckUtils]: 61: Hoare triple {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-07 23:08:46,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-07 23:08:46,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3298#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-07 23:08:46,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-07 23:08:46,209 INFO L290 TraceCheckUtils]: 57: Hoare triple {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-07 23:08:46,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3308#(or (<= 4294967295 (mod (+ main_~x~0 3) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-07 23:08:46,211 INFO L290 TraceCheckUtils]: 55: Hoare triple {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-07 23:08:46,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-07 23:08:46,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3318#(or (<= 4294967295 (mod (+ main_~x~0 4) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-07 23:08:46,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:08:46,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:08:46,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3328#(or (<= 4294967295 (mod (+ 5 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:08:46,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-07 23:08:46,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-07 23:08:46,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3338#(or (<= 4294967295 (mod (+ main_~x~0 6) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-07 23:08:46,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:08:46,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:08:46,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3348#(or (<= 4294967295 (mod (+ 7 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:08:46,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-07 23:08:46,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-07 23:08:46,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3358#(or (<= 4294967295 (mod (+ main_~x~0 8) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-07 23:08:46,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-07 23:08:46,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-07 23:08:46,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3368#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-07 23:08:46,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-07 23:08:46,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-07 23:08:46,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3378#(or (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-07 23:08:46,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-07 23:08:46,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-07 23:08:46,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3388#(or (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-07 23:08:46,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-07 23:08:46,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-07 23:08:46,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3398#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-07 23:08:46,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} is VALID [2022-04-07 23:08:46,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} is VALID [2022-04-07 23:08:46,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3408#(or (<= 4294967295 (mod (+ main_~x~0 13) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))))} is VALID [2022-04-07 23:08:46,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-07 23:08:46,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-07 23:08:46,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3418#(or (<= 4294967295 (mod (+ main_~x~0 14) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-07 23:08:46,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-07 23:08:46,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-07 23:08:46,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3428#(or (<= 4294967295 (mod (+ main_~x~0 15) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-07 23:08:46,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-07 23:08:46,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-07 23:08:46,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3438#(or (<= 4294967295 (mod (+ main_~x~0 16) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-07 23:08:46,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-07 23:08:46,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-07 23:08:46,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3448#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-07 23:08:46,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-07 23:08:46,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-07 23:08:46,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3458#(or (<= 4294967295 (mod (+ main_~x~0 18) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-07 23:08:46,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:08:46,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:08:46,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3468#(or (<= 4294967295 (mod (+ 19 main_~x~0) 4294967296)) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:08:46,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-07 23:08:46,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-07 23:08:46,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {3012#true} [51] mainENTRY-->L11-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] {3478#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-07 23:08:46,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {3012#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:46,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3012#true} {3012#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:46,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {3012#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:46,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {3012#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {3012#true} is VALID [2022-04-07 23:08:46,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {3012#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#true} is VALID [2022-04-07 23:08:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:08:46,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947339541] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:08:46,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:08:46,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 24] total 47 [2022-04-07 23:08:46,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178565746] [2022-04-07 23:08:46,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:08:46,252 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-07 23:08:46,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:08:46,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:08:46,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:08:46,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-07 23:08:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:08:46,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-07 23:08:46,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1569, Unknown=0, NotChecked=0, Total=2162 [2022-04-07 23:08:46,371 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:09:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:09:58,062 INFO L93 Difference]: Finished difference Result 175 states and 211 transitions. [2022-04-07 23:09:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-07 23:09:58,063 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-07 23:09:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:09:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:09:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 176 transitions. [2022-04-07 23:09:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:09:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 176 transitions. [2022-04-07 23:09:58,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 176 transitions. [2022-04-07 23:09:58,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:09:58,312 INFO L225 Difference]: With dead ends: 175 [2022-04-07 23:09:58,312 INFO L226 Difference]: Without dead ends: 153 [2022-04-07 23:09:58,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 69.8s TimeCoverageRelationStatistics Valid=2121, Invalid=5710, Unknown=1, NotChecked=0, Total=7832 [2022-04-07 23:09:58,317 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 316 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-07 23:09:58,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 119 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-07 23:09:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-07 23:09:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-04-07 23:09:58,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:09:58,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:09:58,435 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:09:58,436 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:09:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:09:58,439 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2022-04-07 23:09:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2022-04-07 23:09:58,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:09:58,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:09:58,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-07 23:09:58,440 INFO L87 Difference]: Start difference. First operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-07 23:09:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:09:58,444 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2022-04-07 23:09:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2022-04-07 23:09:58,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:09:58,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:09:58,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:09:58,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:09:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 148 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:09:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions. [2022-04-07 23:09:58,448 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 74 [2022-04-07 23:09:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:09:58,448 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions. [2022-04-07 23:09:58,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 46 states have internal predecessors, (139), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:09:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2022-04-07 23:09:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-07 23:09:58,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:09:58,450 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 42, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:09:58,474 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-07 23:09:58,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:09:58,672 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:09:58,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:09:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1642783383, now seen corresponding path program 5 times [2022-04-07 23:09:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:09:58,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563327996] [2022-04-07 23:09:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:09:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:09:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:09:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:09:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:10:00,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {4387#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {4339#true} is VALID [2022-04-07 23:10:00,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {4339#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:10:00,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4339#true} {4339#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:10:00,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {4339#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:10:00,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {4387#(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 (= (select |v_#length_1| 2) 17) (= 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_#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] {4339#true} is VALID [2022-04-07 23:10:00,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {4339#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:10:00,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4339#true} {4339#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:10:00,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {4339#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:10:00,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {4339#true} [51] mainENTRY-->L11-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] {4344#(= main_~x~0 0)} is VALID [2022-04-07 23:10:00,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {4344#(= main_~x~0 0)} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4344#(= main_~x~0 0)} is VALID [2022-04-07 23:10:00,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {4344#(= main_~x~0 0)} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4344#(= main_~x~0 0)} is VALID [2022-04-07 23:10:00,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {4344#(= main_~x~0 0)} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:10:00,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:10:00,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:10:00,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {4345#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:10:00,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:10:00,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:10:00,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {4346#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:10:00,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:10:00,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:10:00,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {4347#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:10:00,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:10:00,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:10:00,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {4348#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{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#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:10:00,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {4349#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:10:00,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {4349#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~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#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:10:00,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {4349#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:10:00,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:10:00,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:10:00,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {4350#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:10:00,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:10:00,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:10:00,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {4351#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:10:00,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:10:00,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:10:00,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {4352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:10:00,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:10:00,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:10:00,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {4353#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:10:00,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:10:00,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:10:00,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {4354#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:10:00,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:10:00,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:10:00,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {4355#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:10:00,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:10:00,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:10:00,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {4356#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:10:00,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:10:00,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:10:00,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {4357#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:10:00,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:10:00,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:10:00,022 INFO L290 TraceCheckUtils]: 50: Hoare triple {4358#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{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#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:10:00,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {4359#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:10:00,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {4359#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~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#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:10:00,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {4359#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:10:00,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:10:00,024 INFO L290 TraceCheckUtils]: 55: Hoare triple {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:10:00,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {4360#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:10:00,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:10:00,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:10:00,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {4361#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 23:10:00,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 23:10:00,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 23:10:00,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {4362#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:10:00,028 INFO L290 TraceCheckUtils]: 63: Hoare triple {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:10:00,028 INFO L290 TraceCheckUtils]: 64: Hoare triple {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:10:00,029 INFO L290 TraceCheckUtils]: 65: Hoare triple {4363#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 23:10:00,029 INFO L290 TraceCheckUtils]: 66: Hoare triple {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 23:10:00,029 INFO L290 TraceCheckUtils]: 67: Hoare triple {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 23:10:00,030 INFO L290 TraceCheckUtils]: 68: Hoare triple {4364#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 23:10:00,030 INFO L290 TraceCheckUtils]: 69: Hoare triple {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 23:10:00,030 INFO L290 TraceCheckUtils]: 70: Hoare triple {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 23:10:00,031 INFO L290 TraceCheckUtils]: 71: Hoare triple {4365#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 23:10:00,031 INFO L290 TraceCheckUtils]: 72: Hoare triple {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 23:10:00,032 INFO L290 TraceCheckUtils]: 73: Hoare triple {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 23:10:00,032 INFO L290 TraceCheckUtils]: 74: Hoare triple {4366#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 23:10:00,033 INFO L290 TraceCheckUtils]: 75: Hoare triple {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 23:10:00,033 INFO L290 TraceCheckUtils]: 76: Hoare triple {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 23:10:00,033 INFO L290 TraceCheckUtils]: 77: Hoare triple {4367#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 23:10:00,034 INFO L290 TraceCheckUtils]: 78: Hoare triple {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 23:10:00,034 INFO L290 TraceCheckUtils]: 79: Hoare triple {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 23:10:00,035 INFO L290 TraceCheckUtils]: 80: Hoare triple {4368#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{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#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 23:10:00,035 INFO L290 TraceCheckUtils]: 81: Hoare triple {4369#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 23:10:00,036 INFO L290 TraceCheckUtils]: 82: Hoare triple {4369#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~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#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 23:10:00,036 INFO L290 TraceCheckUtils]: 83: Hoare triple {4369#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 23:10:00,036 INFO L290 TraceCheckUtils]: 84: Hoare triple {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 23:10:00,037 INFO L290 TraceCheckUtils]: 85: Hoare triple {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 23:10:00,038 INFO L290 TraceCheckUtils]: 86: Hoare triple {4370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 23:10:00,038 INFO L290 TraceCheckUtils]: 87: Hoare triple {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 23:10:00,039 INFO L290 TraceCheckUtils]: 88: Hoare triple {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 23:10:00,039 INFO L290 TraceCheckUtils]: 89: Hoare triple {4371#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 23:10:00,039 INFO L290 TraceCheckUtils]: 90: Hoare triple {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 23:10:00,040 INFO L290 TraceCheckUtils]: 91: Hoare triple {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 23:10:00,040 INFO L290 TraceCheckUtils]: 92: Hoare triple {4372#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-07 23:10:00,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-07 23:10:00,041 INFO L290 TraceCheckUtils]: 94: Hoare triple {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-07 23:10:00,042 INFO L290 TraceCheckUtils]: 95: Hoare triple {4373#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 23:10:00,042 INFO L290 TraceCheckUtils]: 96: Hoare triple {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 23:10:00,042 INFO L290 TraceCheckUtils]: 97: Hoare triple {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 23:10:00,043 INFO L290 TraceCheckUtils]: 98: Hoare triple {4374#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-07 23:10:00,043 INFO L290 TraceCheckUtils]: 99: Hoare triple {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-07 23:10:00,044 INFO L290 TraceCheckUtils]: 100: Hoare triple {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-07 23:10:00,044 INFO L290 TraceCheckUtils]: 101: Hoare triple {4375#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 23:10:00,044 INFO L290 TraceCheckUtils]: 102: Hoare triple {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 23:10:00,045 INFO L290 TraceCheckUtils]: 103: Hoare triple {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 23:10:00,045 INFO L290 TraceCheckUtils]: 104: Hoare triple {4376#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-07 23:10:00,046 INFO L290 TraceCheckUtils]: 105: Hoare triple {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-07 23:10:00,046 INFO L290 TraceCheckUtils]: 106: Hoare triple {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-07 23:10:00,047 INFO L290 TraceCheckUtils]: 107: Hoare triple {4377#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 23:10:00,047 INFO L290 TraceCheckUtils]: 108: Hoare triple {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 23:10:00,047 INFO L290 TraceCheckUtils]: 109: Hoare triple {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 23:10:00,048 INFO L290 TraceCheckUtils]: 110: Hoare triple {4378#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{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#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-07 23:10:00,048 INFO L290 TraceCheckUtils]: 111: Hoare triple {4379#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-07 23:10:00,049 INFO L290 TraceCheckUtils]: 112: Hoare triple {4379#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~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#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-07 23:10:00,049 INFO L290 TraceCheckUtils]: 113: Hoare triple {4379#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 23:10:00,049 INFO L290 TraceCheckUtils]: 114: Hoare triple {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 23:10:00,050 INFO L290 TraceCheckUtils]: 115: Hoare triple {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 23:10:00,050 INFO L290 TraceCheckUtils]: 116: Hoare triple {4380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-07 23:10:00,051 INFO L290 TraceCheckUtils]: 117: Hoare triple {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-07 23:10:00,051 INFO L290 TraceCheckUtils]: 118: Hoare triple {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-07 23:10:00,052 INFO L290 TraceCheckUtils]: 119: Hoare triple {4381#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 23:10:00,052 INFO L290 TraceCheckUtils]: 120: Hoare triple {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 23:10:00,052 INFO L290 TraceCheckUtils]: 121: Hoare triple {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 23:10:00,053 INFO L290 TraceCheckUtils]: 122: Hoare triple {4382#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-07 23:10:00,053 INFO L290 TraceCheckUtils]: 123: Hoare triple {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-07 23:10:00,054 INFO L290 TraceCheckUtils]: 124: Hoare triple {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-07 23:10:00,054 INFO L290 TraceCheckUtils]: 125: Hoare triple {4383#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-07 23:10:00,054 INFO L290 TraceCheckUtils]: 126: Hoare triple {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-07 23:10:00,055 INFO L290 TraceCheckUtils]: 127: Hoare triple {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-07 23:10:00,055 INFO L290 TraceCheckUtils]: 128: Hoare triple {4384#(and (<= main_~x~0 40) (<= 40 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-07 23:10:00,056 INFO L290 TraceCheckUtils]: 129: Hoare triple {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-07 23:10:00,056 INFO L290 TraceCheckUtils]: 130: Hoare triple {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-07 23:10:00,057 INFO L290 TraceCheckUtils]: 131: Hoare triple {4385#(and (<= main_~x~0 41) (<= 41 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4386#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:10:00,057 INFO L290 TraceCheckUtils]: 132: Hoare triple {4386#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4386#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 133: Hoare triple {4386#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 134: Hoare triple {4340#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 135: Hoare triple {4340#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 136: Hoare triple {4340#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 137: Hoare triple {4340#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 138: Hoare triple {4340#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 139: Hoare triple {4340#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 140: Hoare triple {4340#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 141: Hoare triple {4340#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 142: Hoare triple {4340#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 143: Hoare triple {4340#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4340#false} is VALID [2022-04-07 23:10:00,058 INFO L290 TraceCheckUtils]: 144: Hoare triple {4340#false} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:10:00,059 INFO L290 TraceCheckUtils]: 145: Hoare triple {4340#false} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4340#false} is VALID [2022-04-07 23:10:00,059 INFO L290 TraceCheckUtils]: 146: Hoare triple {4340#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4340#false} is VALID [2022-04-07 23:10:00,059 INFO L290 TraceCheckUtils]: 147: Hoare triple {4340#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:10:00,059 INFO L272 TraceCheckUtils]: 148: Hoare triple {4340#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {4340#false} is VALID [2022-04-07 23:10:00,059 INFO L290 TraceCheckUtils]: 149: Hoare triple {4340#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] {4340#false} is VALID [2022-04-07 23:10:00,059 INFO L290 TraceCheckUtils]: 150: Hoare triple {4340#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[] {4340#false} is VALID [2022-04-07 23:10:00,059 INFO L290 TraceCheckUtils]: 151: Hoare triple {4340#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:10:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 597 proven. 2667 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-07 23:10:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:10:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563327996] [2022-04-07 23:10:00,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563327996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:10:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727451666] [2022-04-07 23:10:00,077 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 23:10:00,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:10:00,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:10:00,079 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-07 23:10:00,103 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-07 23:13:57,964 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2022-04-07 23:13:57,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:13:58,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 98 conjunts are in the unsatisfiable core [2022-04-07 23:13:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:13:58,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:14:00,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {4339#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:14:00,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {4339#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {4339#true} is VALID [2022-04-07 23:14:00,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {4339#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:14:00,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4339#true} {4339#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:14:00,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {4339#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:14:00,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {4339#true} [51] mainENTRY-->L11-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] {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {4406#(and (= main_~x~0 0) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} is VALID [2022-04-07 23:14:00,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} is VALID [2022-04-07 23:14:00,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} is VALID [2022-04-07 23:14:00,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {4416#(and (= main_~y~0 10000000) (= main_~x~0 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {4426#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} is VALID [2022-04-07 23:14:00,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} is VALID [2022-04-07 23:14:00,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} is VALID [2022-04-07 23:14:00,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {4436#(and (= main_~y~0 10000000) (= (+ (- 2) main_~x~0) 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} is VALID [2022-04-07 23:14:00,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} is VALID [2022-04-07 23:14:00,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} is VALID [2022-04-07 23:14:00,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 1))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} is VALID [2022-04-07 23:14:00,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} is VALID [2022-04-07 23:14:00,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} is VALID [2022-04-07 23:14:00,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {4456#(and (= main_~y~0 10000000) (= 5 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} is VALID [2022-04-07 23:14:00,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} is VALID [2022-04-07 23:14:00,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} is VALID [2022-04-07 23:14:00,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {4466#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 5))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:00,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:00,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:00,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {4476#(and (= main_~y~0 10000000) (= 5 (+ (- 2) main_~x~0)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} is VALID [2022-04-07 23:14:00,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} is VALID [2022-04-07 23:14:00,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} is VALID [2022-04-07 23:14:00,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {4486#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 3)) 5))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} is VALID [2022-04-07 23:14:00,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} is VALID [2022-04-07 23:14:00,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} is VALID [2022-04-07 23:14:00,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {4496#(and (= main_~y~0 10000000) (= main_~x~0 9))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {4506#(and (= (+ (- 1) main_~x~0) 9) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} is VALID [2022-04-07 23:14:00,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} is VALID [2022-04-07 23:14:00,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} is VALID [2022-04-07 23:14:00,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {4516#(and (= main_~y~0 10000000) (= main_~x~0 11))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} is VALID [2022-04-07 23:14:00,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} is VALID [2022-04-07 23:14:00,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} is VALID [2022-04-07 23:14:00,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {4526#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 11))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,964 INFO L290 TraceCheckUtils]: 47: Hoare triple {4536#(and (= 11 (+ (- 2) main_~x~0)) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,964 INFO L290 TraceCheckUtils]: 48: Hoare triple {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,965 INFO L290 TraceCheckUtils]: 50: Hoare triple {4546#(and (= (+ main_~x~0 (- 3)) 11) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} is VALID [2022-04-07 23:14:00,966 INFO L290 TraceCheckUtils]: 51: Hoare triple {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} is VALID [2022-04-07 23:14:00,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} is VALID [2022-04-07 23:14:00,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {4556#(and (= main_~y~0 10000000) (= (+ main_~x~0 (- 4)) 11))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} is VALID [2022-04-07 23:14:00,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} is VALID [2022-04-07 23:14:00,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} is VALID [2022-04-07 23:14:00,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {4566#(and (= main_~y~0 10000000) (= main_~x~0 16))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} is VALID [2022-04-07 23:14:00,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} is VALID [2022-04-07 23:14:00,969 INFO L290 TraceCheckUtils]: 58: Hoare triple {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} is VALID [2022-04-07 23:14:00,970 INFO L290 TraceCheckUtils]: 59: Hoare triple {4576#(and (= main_~y~0 10000000) (= main_~x~0 17))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,970 INFO L290 TraceCheckUtils]: 60: Hoare triple {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,971 INFO L290 TraceCheckUtils]: 62: Hoare triple {4586#(and (= (+ (- 1) main_~x~0) 17) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} is VALID [2022-04-07 23:14:00,972 INFO L290 TraceCheckUtils]: 63: Hoare triple {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} is VALID [2022-04-07 23:14:00,972 INFO L290 TraceCheckUtils]: 64: Hoare triple {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} is VALID [2022-04-07 23:14:00,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {4596#(and (= main_~y~0 10000000) (= 19 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} is VALID [2022-04-07 23:14:00,973 INFO L290 TraceCheckUtils]: 66: Hoare triple {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} is VALID [2022-04-07 23:14:00,974 INFO L290 TraceCheckUtils]: 67: Hoare triple {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} is VALID [2022-04-07 23:14:00,974 INFO L290 TraceCheckUtils]: 68: Hoare triple {4606#(and (= main_~y~0 10000000) (= main_~x~0 20))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} is VALID [2022-04-07 23:14:00,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} is VALID [2022-04-07 23:14:00,975 INFO L290 TraceCheckUtils]: 70: Hoare triple {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} is VALID [2022-04-07 23:14:00,976 INFO L290 TraceCheckUtils]: 71: Hoare triple {4616#(and (= main_~y~0 10000000) (= main_~x~0 21))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} is VALID [2022-04-07 23:14:00,976 INFO L290 TraceCheckUtils]: 72: Hoare triple {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} is VALID [2022-04-07 23:14:00,977 INFO L290 TraceCheckUtils]: 73: Hoare triple {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} is VALID [2022-04-07 23:14:00,977 INFO L290 TraceCheckUtils]: 74: Hoare triple {4626#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 21))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:00,978 INFO L290 TraceCheckUtils]: 75: Hoare triple {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:00,978 INFO L290 TraceCheckUtils]: 76: Hoare triple {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:00,979 INFO L290 TraceCheckUtils]: 77: Hoare triple {4636#(and (= main_~y~0 10000000) (= 21 (+ (- 2) main_~x~0)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,979 INFO L290 TraceCheckUtils]: 78: Hoare triple {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,980 INFO L290 TraceCheckUtils]: 79: Hoare triple {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,980 INFO L290 TraceCheckUtils]: 80: Hoare triple {4646#(and (= main_~x~0 24) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,981 INFO L290 TraceCheckUtils]: 81: Hoare triple {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,981 INFO L290 TraceCheckUtils]: 82: Hoare triple {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,982 INFO L290 TraceCheckUtils]: 83: Hoare triple {4656#(and (= (+ (- 1) main_~x~0) 24) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} is VALID [2022-04-07 23:14:00,982 INFO L290 TraceCheckUtils]: 84: Hoare triple {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} is VALID [2022-04-07 23:14:00,983 INFO L290 TraceCheckUtils]: 85: Hoare triple {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} is VALID [2022-04-07 23:14:00,983 INFO L290 TraceCheckUtils]: 86: Hoare triple {4666#(and (= main_~y~0 10000000) (= main_~x~0 26))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} is VALID [2022-04-07 23:14:00,984 INFO L290 TraceCheckUtils]: 87: Hoare triple {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} is VALID [2022-04-07 23:14:00,984 INFO L290 TraceCheckUtils]: 88: Hoare triple {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} is VALID [2022-04-07 23:14:00,985 INFO L290 TraceCheckUtils]: 89: Hoare triple {4676#(and (= main_~y~0 10000000) (= main_~x~0 27))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,985 INFO L290 TraceCheckUtils]: 90: Hoare triple {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,985 INFO L290 TraceCheckUtils]: 91: Hoare triple {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,986 INFO L290 TraceCheckUtils]: 92: Hoare triple {4686#(and (= (+ (- 1) main_~x~0) 27) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,986 INFO L290 TraceCheckUtils]: 93: Hoare triple {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,987 INFO L290 TraceCheckUtils]: 95: Hoare triple {4696#(and (= 29 main_~x~0) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} is VALID [2022-04-07 23:14:00,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} is VALID [2022-04-07 23:14:00,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} is VALID [2022-04-07 23:14:00,989 INFO L290 TraceCheckUtils]: 98: Hoare triple {4706#(and (= main_~y~0 10000000) (= 30 main_~x~0))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,989 INFO L290 TraceCheckUtils]: 99: Hoare triple {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,990 INFO L290 TraceCheckUtils]: 100: Hoare triple {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,990 INFO L290 TraceCheckUtils]: 101: Hoare triple {4716#(and (= (+ (- 1) main_~x~0) 30) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:00,991 INFO L290 TraceCheckUtils]: 102: Hoare triple {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:00,991 INFO L290 TraceCheckUtils]: 103: Hoare triple {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:00,992 INFO L290 TraceCheckUtils]: 104: Hoare triple {4726#(and (= main_~y~0 10000000) (= 30 (+ (- 2) main_~x~0)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,992 INFO L290 TraceCheckUtils]: 105: Hoare triple {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,993 INFO L290 TraceCheckUtils]: 106: Hoare triple {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,993 INFO L290 TraceCheckUtils]: 107: Hoare triple {4736#(and (= main_~x~0 33) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} is VALID [2022-04-07 23:14:00,994 INFO L290 TraceCheckUtils]: 108: Hoare triple {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} is VALID [2022-04-07 23:14:00,994 INFO L290 TraceCheckUtils]: 109: Hoare triple {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} is VALID [2022-04-07 23:14:00,995 INFO L290 TraceCheckUtils]: 110: Hoare triple {4746#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 33))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,995 INFO L290 TraceCheckUtils]: 111: Hoare triple {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,996 INFO L290 TraceCheckUtils]: 112: Hoare triple {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:00,996 INFO L290 TraceCheckUtils]: 113: Hoare triple {4756#(and (= 35 main_~x~0) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} is VALID [2022-04-07 23:14:00,996 INFO L290 TraceCheckUtils]: 114: Hoare triple {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} is VALID [2022-04-07 23:14:00,997 INFO L290 TraceCheckUtils]: 115: Hoare triple {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} is VALID [2022-04-07 23:14:00,997 INFO L290 TraceCheckUtils]: 116: Hoare triple {4766#(and (= main_~y~0 10000000) (= main_~x~0 36))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} is VALID [2022-04-07 23:14:00,998 INFO L290 TraceCheckUtils]: 117: Hoare triple {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} is VALID [2022-04-07 23:14:00,998 INFO L290 TraceCheckUtils]: 118: Hoare triple {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} is VALID [2022-04-07 23:14:00,999 INFO L290 TraceCheckUtils]: 119: Hoare triple {4776#(and (= main_~y~0 10000000) (= main_~x~0 37))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} is VALID [2022-04-07 23:14:00,999 INFO L290 TraceCheckUtils]: 120: Hoare triple {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} is VALID [2022-04-07 23:14:01,000 INFO L290 TraceCheckUtils]: 121: Hoare triple {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} is VALID [2022-04-07 23:14:01,000 INFO L290 TraceCheckUtils]: 122: Hoare triple {4786#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 37))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} is VALID [2022-04-07 23:14:01,001 INFO L290 TraceCheckUtils]: 123: Hoare triple {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} is VALID [2022-04-07 23:14:01,001 INFO L290 TraceCheckUtils]: 124: Hoare triple {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} is VALID [2022-04-07 23:14:01,002 INFO L290 TraceCheckUtils]: 125: Hoare triple {4796#(and (= main_~y~0 10000000) (= main_~x~0 39))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} is VALID [2022-04-07 23:14:01,002 INFO L290 TraceCheckUtils]: 126: Hoare triple {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} is VALID [2022-04-07 23:14:01,003 INFO L290 TraceCheckUtils]: 127: Hoare triple {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} is VALID [2022-04-07 23:14:01,003 INFO L290 TraceCheckUtils]: 128: Hoare triple {4806#(and (= main_~y~0 10000000) (= (+ (- 1) main_~x~0) 39))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:01,004 INFO L290 TraceCheckUtils]: 129: Hoare triple {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:01,004 INFO L290 TraceCheckUtils]: 130: Hoare triple {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} is VALID [2022-04-07 23:14:01,005 INFO L290 TraceCheckUtils]: 131: Hoare triple {4816#(and (= main_~y~0 10000000) (= 39 (+ (- 2) main_~x~0)))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:01,005 INFO L290 TraceCheckUtils]: 132: Hoare triple {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:01,006 INFO L290 TraceCheckUtils]: 133: Hoare triple {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:01,006 INFO L290 TraceCheckUtils]: 134: Hoare triple {4826#(and (= (+ main_~x~0 (- 3)) 39) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:01,007 INFO L290 TraceCheckUtils]: 135: Hoare triple {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:01,007 INFO L290 TraceCheckUtils]: 136: Hoare triple {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:01,008 INFO L290 TraceCheckUtils]: 137: Hoare triple {4836#(and (= 39 (+ main_~x~0 (- 4))) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:01,008 INFO L290 TraceCheckUtils]: 138: Hoare triple {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:01,009 INFO L290 TraceCheckUtils]: 139: Hoare triple {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} is VALID [2022-04-07 23:14:01,009 INFO L290 TraceCheckUtils]: 140: Hoare triple {4846#(and (= 39 (+ main_~x~0 (- 5))) (= main_~y~0 10000000))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} is VALID [2022-04-07 23:14:01,010 INFO L290 TraceCheckUtils]: 141: Hoare triple {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} is VALID [2022-04-07 23:14:01,010 INFO L290 TraceCheckUtils]: 142: Hoare triple {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} is VALID [2022-04-07 23:14:01,010 INFO L290 TraceCheckUtils]: 143: Hoare triple {4856#(and (= main_~y~0 10000000) (= 39 (+ main_~x~0 (- 6))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4866#(and (= main_~y~0 10000000) (= main_~x~0 46))} is VALID [2022-04-07 23:14:01,011 INFO L290 TraceCheckUtils]: 144: Hoare triple {4866#(and (= main_~y~0 10000000) (= main_~x~0 46))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4870#(= main_~x~0 46)} is VALID [2022-04-07 23:14:01,011 INFO L290 TraceCheckUtils]: 145: Hoare triple {4870#(= main_~x~0 46)} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4340#false} is VALID [2022-04-07 23:14:01,011 INFO L290 TraceCheckUtils]: 146: Hoare triple {4340#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4340#false} is VALID [2022-04-07 23:14:01,012 INFO L290 TraceCheckUtils]: 147: Hoare triple {4340#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:14:01,012 INFO L272 TraceCheckUtils]: 148: Hoare triple {4340#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {4340#false} is VALID [2022-04-07 23:14:01,012 INFO L290 TraceCheckUtils]: 149: Hoare triple {4340#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] {4340#false} is VALID [2022-04-07 23:14:01,012 INFO L290 TraceCheckUtils]: 150: Hoare triple {4340#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[] {4340#false} is VALID [2022-04-07 23:14:01,012 INFO L290 TraceCheckUtils]: 151: Hoare triple {4340#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:14:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 93 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:14:01,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:14:06,536 INFO L290 TraceCheckUtils]: 151: Hoare triple {4340#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:14:06,536 INFO L290 TraceCheckUtils]: 150: Hoare triple {4340#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[] {4340#false} is VALID [2022-04-07 23:14:06,536 INFO L290 TraceCheckUtils]: 149: Hoare triple {4340#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] {4340#false} is VALID [2022-04-07 23:14:06,536 INFO L272 TraceCheckUtils]: 148: Hoare triple {4340#false} [56] L11-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {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_~z~0] {4340#false} is VALID [2022-04-07 23:14:06,537 INFO L290 TraceCheckUtils]: 147: Hoare triple {4340#false} [54] L11-2-->L11-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4340#false} is VALID [2022-04-07 23:14:06,537 INFO L290 TraceCheckUtils]: 146: Hoare triple {4340#false} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4340#false} is VALID [2022-04-07 23:14:06,537 INFO L290 TraceCheckUtils]: 145: Hoare triple {4910#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4340#false} is VALID [2022-04-07 23:14:06,537 INFO L290 TraceCheckUtils]: 144: Hoare triple {4914#(or (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4910#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 23:14:06,539 INFO L290 TraceCheckUtils]: 143: Hoare triple {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4914#(or (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-07 23:14:06,539 INFO L290 TraceCheckUtils]: 142: Hoare triple {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} is VALID [2022-04-07 23:14:06,540 INFO L290 TraceCheckUtils]: 141: Hoare triple {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} is VALID [2022-04-07 23:14:06,540 INFO L290 TraceCheckUtils]: 140: Hoare triple {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4918#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} is VALID [2022-04-07 23:14:06,541 INFO L290 TraceCheckUtils]: 139: Hoare triple {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,541 INFO L290 TraceCheckUtils]: 138: Hoare triple {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,542 INFO L290 TraceCheckUtils]: 137: Hoare triple {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4928#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,542 INFO L290 TraceCheckUtils]: 136: Hoare triple {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-07 23:14:06,543 INFO L290 TraceCheckUtils]: 135: Hoare triple {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-07 23:14:06,543 INFO L290 TraceCheckUtils]: 134: Hoare triple {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4938#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-07 23:14:06,544 INFO L290 TraceCheckUtils]: 133: Hoare triple {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} [57] L12-->L12-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_1 1) v_main_~z~0_2)) 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] {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-07 23:14:06,544 INFO L290 TraceCheckUtils]: 132: Hoare triple {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-07 23:14:06,545 INFO L290 TraceCheckUtils]: 131: Hoare triple {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4948#(or (not (< (mod (+ main_~x~0 4) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 4) 4294967296))))} is VALID [2022-04-07 23:14:06,546 INFO L290 TraceCheckUtils]: 130: Hoare triple {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,546 INFO L290 TraceCheckUtils]: 129: Hoare triple {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,547 INFO L290 TraceCheckUtils]: 128: Hoare triple {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4958#(or (not (< (mod (+ 5 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,547 INFO L290 TraceCheckUtils]: 127: Hoare triple {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-07 23:14:06,547 INFO L290 TraceCheckUtils]: 126: Hoare triple {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-07 23:14:06,548 INFO L290 TraceCheckUtils]: 125: Hoare triple {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4968#(or (not (< (mod (+ main_~x~0 6) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-07 23:14:06,548 INFO L290 TraceCheckUtils]: 124: Hoare triple {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,549 INFO L290 TraceCheckUtils]: 123: Hoare triple {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,549 INFO L290 TraceCheckUtils]: 122: Hoare triple {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4978#(or (not (< (mod (+ 7 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,550 INFO L290 TraceCheckUtils]: 121: Hoare triple {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-07 23:14:06,550 INFO L290 TraceCheckUtils]: 120: Hoare triple {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-07 23:14:06,551 INFO L290 TraceCheckUtils]: 119: Hoare triple {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4988#(or (not (< (mod (+ main_~x~0 8) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 8) 4294967296))))} is VALID [2022-04-07 23:14:06,551 INFO L290 TraceCheckUtils]: 118: Hoare triple {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,551 INFO L290 TraceCheckUtils]: 117: Hoare triple {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,552 INFO L290 TraceCheckUtils]: 116: Hoare triple {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4998#(or (not (<= 5000000 (mod (+ main_~x~0 9) 4294967296))) (not (< (mod (+ main_~x~0 9) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,552 INFO L290 TraceCheckUtils]: 115: Hoare triple {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} is VALID [2022-04-07 23:14:06,553 INFO L290 TraceCheckUtils]: 114: Hoare triple {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} is VALID [2022-04-07 23:14:06,554 INFO L290 TraceCheckUtils]: 113: Hoare triple {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5008#(or (not (< (mod (+ main_~x~0 10) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 10) 4294967296))))} is VALID [2022-04-07 23:14:06,554 INFO L290 TraceCheckUtils]: 112: Hoare triple {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} is VALID [2022-04-07 23:14:06,554 INFO L290 TraceCheckUtils]: 111: Hoare triple {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} is VALID [2022-04-07 23:14:06,555 INFO L290 TraceCheckUtils]: 110: Hoare triple {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5018#(or (not (< (mod (+ main_~x~0 11) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 11) 4294967296))))} is VALID [2022-04-07 23:14:06,556 INFO L290 TraceCheckUtils]: 109: Hoare triple {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,556 INFO L290 TraceCheckUtils]: 108: Hoare triple {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,557 INFO L290 TraceCheckUtils]: 107: Hoare triple {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5028#(or (not (<= 5000000 (mod (+ main_~x~0 12) 4294967296))) (not (< (mod (+ main_~x~0 12) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,557 INFO L290 TraceCheckUtils]: 106: Hoare triple {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,557 INFO L290 TraceCheckUtils]: 105: Hoare triple {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,558 INFO L290 TraceCheckUtils]: 104: Hoare triple {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5038#(or (not (<= 5000000 (mod (+ main_~x~0 13) 4294967296))) (not (< (mod (+ main_~x~0 13) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,559 INFO L290 TraceCheckUtils]: 103: Hoare triple {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-07 23:14:06,559 INFO L290 TraceCheckUtils]: 102: Hoare triple {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-07 23:14:06,560 INFO L290 TraceCheckUtils]: 101: Hoare triple {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5048#(or (not (< (mod (+ main_~x~0 14) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 14) 4294967296))))} is VALID [2022-04-07 23:14:06,560 INFO L290 TraceCheckUtils]: 100: Hoare triple {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-07 23:14:06,561 INFO L290 TraceCheckUtils]: 99: Hoare triple {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-07 23:14:06,561 INFO L290 TraceCheckUtils]: 98: Hoare triple {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5058#(or (not (< (mod (+ main_~x~0 15) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 15) 4294967296))))} is VALID [2022-04-07 23:14:06,562 INFO L290 TraceCheckUtils]: 97: Hoare triple {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-07 23:14:06,562 INFO L290 TraceCheckUtils]: 96: Hoare triple {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-07 23:14:06,563 INFO L290 TraceCheckUtils]: 95: Hoare triple {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5068#(or (not (< (mod (+ main_~x~0 16) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 16) 4294967296))))} is VALID [2022-04-07 23:14:06,563 INFO L290 TraceCheckUtils]: 94: Hoare triple {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,564 INFO L290 TraceCheckUtils]: 92: Hoare triple {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5078#(or (not (<= 5000000 (mod (+ main_~x~0 17) 4294967296))) (not (< (mod (+ main_~x~0 17) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,565 INFO L290 TraceCheckUtils]: 91: Hoare triple {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-07 23:14:06,565 INFO L290 TraceCheckUtils]: 90: Hoare triple {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-07 23:14:06,566 INFO L290 TraceCheckUtils]: 89: Hoare triple {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5088#(or (not (< (mod (+ main_~x~0 18) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 18) 4294967296))))} is VALID [2022-04-07 23:14:06,566 INFO L290 TraceCheckUtils]: 88: Hoare triple {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,567 INFO L290 TraceCheckUtils]: 87: Hoare triple {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,568 INFO L290 TraceCheckUtils]: 86: Hoare triple {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5098#(or (not (< (mod (+ 19 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,569 INFO L290 TraceCheckUtils]: 85: Hoare triple {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5108#(or (not (<= 5000000 (mod (+ main_~x~0 20) 4294967296))) (not (< (mod (+ main_~x~0 20) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,571 INFO L290 TraceCheckUtils]: 81: Hoare triple {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,572 INFO L290 TraceCheckUtils]: 80: Hoare triple {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5118#(or (not (<= 5000000 (mod (+ main_~x~0 21) 4294967296))) (not (< (mod (+ main_~x~0 21) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,573 INFO L290 TraceCheckUtils]: 79: Hoare triple {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,577 INFO L290 TraceCheckUtils]: 77: Hoare triple {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5128#(or (not (<= 5000000 (mod (+ main_~x~0 22) 4294967296))) (not (< (mod (+ main_~x~0 22) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,578 INFO L290 TraceCheckUtils]: 76: Hoare triple {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,578 INFO L290 TraceCheckUtils]: 75: Hoare triple {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,579 INFO L290 TraceCheckUtils]: 74: Hoare triple {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5138#(or (not (< (mod (+ 23 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 23 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,579 INFO L290 TraceCheckUtils]: 73: Hoare triple {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,579 INFO L290 TraceCheckUtils]: 72: Hoare triple {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,581 INFO L290 TraceCheckUtils]: 71: Hoare triple {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5148#(or (not (<= 5000000 (mod (+ main_~x~0 24) 4294967296))) (not (< (mod (+ main_~x~0 24) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,581 INFO L290 TraceCheckUtils]: 70: Hoare triple {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,583 INFO L290 TraceCheckUtils]: 68: Hoare triple {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5158#(or (not (<= 5000000 (mod (+ main_~x~0 25) 4294967296))) (not (< (mod (+ main_~x~0 25) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} is VALID [2022-04-07 23:14:06,584 INFO L290 TraceCheckUtils]: 66: Hoare triple {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} is VALID [2022-04-07 23:14:06,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {5178#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5168#(or (not (< (mod (+ main_~x~0 26) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 26) 4294967296))))} is VALID [2022-04-07 23:14:06,585 INFO L290 TraceCheckUtils]: 64: Hoare triple {5178#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~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#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} is VALID [2022-04-07 23:14:06,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {5178#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} is VALID [2022-04-07 23:14:06,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {5188#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{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#(or (not (< (mod (+ main_~x~0 27) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 27) 4294967296))))} is VALID [2022-04-07 23:14:06,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {5188#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~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#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {5188#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,589 INFO L290 TraceCheckUtils]: 59: Hoare triple {5198#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{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#(or (not (<= 5000000 (mod (+ main_~x~0 28) 4294967296))) (not (< (mod (+ main_~x~0 28) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {5198#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~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#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {5198#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,590 INFO L290 TraceCheckUtils]: 56: Hoare triple {5208#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{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#(or (not (< (mod (+ 29 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 29 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {5208#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~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#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {5208#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=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#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{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#(or (not (<= 5000000 (mod (+ 30 main_~x~0) 4294967296))) (not (< (mod (+ 30 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} is VALID [2022-04-07 23:14:06,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} is VALID [2022-04-07 23:14:06,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5218#(or (not (< (mod (+ main_~x~0 31) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 31) 4294967296))))} is VALID [2022-04-07 23:14:06,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5228#(or (not (< (mod (+ 32 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 32 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5238#(or (not (<= 5000000 (mod (+ main_~x~0 33) 4294967296))) (not (< (mod (+ main_~x~0 33) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5248#(or (not (<= 5000000 (mod (+ main_~x~0 34) 4294967296))) (not (< (mod (+ main_~x~0 34) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5258#(or (not (< (mod (+ 35 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 35 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5268#(or (not (<= 5000000 (mod (+ main_~x~0 36) 4294967296))) (not (< (mod (+ main_~x~0 36) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} is VALID [2022-04-07 23:14:06,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} is VALID [2022-04-07 23:14:06,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5278#(or (not (< (mod (+ main_~x~0 37) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 37) 4294967296))))} is VALID [2022-04-07 23:14:06,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} is VALID [2022-04-07 23:14:06,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} is VALID [2022-04-07 23:14:06,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5288#(or (not (< (mod (+ main_~x~0 38) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 38) 4294967296))))} is VALID [2022-04-07 23:14:06,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} is VALID [2022-04-07 23:14:06,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} is VALID [2022-04-07 23:14:06,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5298#(or (not (< (mod (+ main_~x~0 39) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 39) 4294967296))))} is VALID [2022-04-07 23:14:06,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5308#(or (not (< (mod (+ 40 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 40 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5318#(or (not (< (mod (+ 41 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 41 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5328#(or (not (<= 5000000 (mod (+ 42 main_~x~0) 4294967296))) (not (< (mod (+ 42 main_~x~0) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5338#(or (not (<= 5000000 (mod (+ main_~x~0 43) 4294967296))) (not (< (mod (+ main_~x~0 43) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-07 23:14:06,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5348#(or (not (< (mod (+ 44 main_~x~0) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ 44 main_~x~0) 4294967296))))} is VALID [2022-04-07 23:14:06,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} is VALID [2022-04-07 23:14:06,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} is VALID [2022-04-07 23:14:06,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} [61] L12-2-->L11-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5358#(or (not (< (mod (+ main_~x~0 45) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 45) 4294967296))))} is VALID [2022-04-07 23:14:06,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} [58] L12-->L12-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} is VALID [2022-04-07 23:14:06,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} [55] L11-2-->L12: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} is VALID [2022-04-07 23:14:06,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {4339#true} [51] mainENTRY-->L11-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] {5368#(or (not (< (mod (+ main_~x~0 46) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 46) 4294967296))))} is VALID [2022-04-07 23:14:06,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {4339#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:14:06,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4339#true} {4339#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:14:06,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {4339#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:14:06,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {4339#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 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_#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] {4339#true} is VALID [2022-04-07 23:14:06,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {4339#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4339#true} is VALID [2022-04-07 23:14:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 93 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:14:06,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727451666] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:14:06,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:14:06,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 50, 50] total 142 [2022-04-07 23:14:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085699808] [2022-04-07 23:14:06,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:14:06,633 INFO L78 Accepts]: Start accepts. Automaton has has 142 states, 142 states have (on average 2.964788732394366) internal successors, (421), 141 states have internal predecessors, (421), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-07 23:14:06,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:14:06,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 142 states, 142 states have (on average 2.964788732394366) internal successors, (421), 141 states have internal predecessors, (421), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:14:06,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:14:06,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 142 states [2022-04-07 23:14:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:14:07,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2022-04-07 23:14:07,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4778, Invalid=15244, Unknown=0, NotChecked=0, Total=20022 [2022-04-07 23:14:07,005 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand has 142 states, 142 states have (on average 2.964788732394366) internal successors, (421), 141 states have internal predecessors, (421), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:14:21,499 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296))) (and (let ((.cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse0 .cse1)) (not (<= 5000000 .cse0)))) (let ((.cse2 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (not (< .cse2 .cse1)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse3 (mod (+ 3 c_main_~x~0) 4294967296))) (or (not (< .cse3 .cse1)) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (<= 5000000 .cse4)) (not (< .cse4 .cse1)))) (let ((.cse5 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (not (< .cse5 .cse1)))) (let ((.cse6 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse6)) (not (< .cse6 .cse1)))) (let ((.cse7 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse7 .cse1)) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse8 .cse1)) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse9)) (not (< .cse9 .cse1)))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (not (< .cse10 .cse1)))) (let ((.cse11 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse11 .cse1)) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse12 .cse1)) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse13 .cse1)) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 6 c_main_~x~0) 4294967296))) (or (not (< .cse14 .cse1)) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (not (< .cse15 .cse1)))) (let ((.cse16 (mod (+ 36 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (not (< .cse16 .cse1)))) (let ((.cse17 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse17 .cse1)) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse18 .cse1)) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (< .cse19 .cse1)) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (not (< .cse20 .cse1)))) (let ((.cse21 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (not (< .cse21 .cse1)))) (let ((.cse22 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse22 .cse1)) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse23 .cse1)) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 39 c_main_~x~0) 4294967296))) (or (not (< .cse24 .cse1)) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 13 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (not (< .cse25 .cse1)))) (let ((.cse26 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (< .cse26 .cse1)) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 11) 4294967296))) (or (not (< .cse27 .cse1)) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse28 .cse1)) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (not (< .cse29 .cse1)))) (let ((.cse30 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (not (< .cse30 .cse1)))) (let ((.cse31 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (not (< .cse31 .cse1)))) (let ((.cse32 (mod (+ 16 c_main_~x~0) 4294967296))) (or (not (< .cse32 .cse1)) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse33)) (not (< .cse33 .cse1)))) (let ((.cse34 (mod (+ 17 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (not (< .cse34 .cse1)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (not (< .cse35 .cse1)))) (let ((.cse36 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (not (< .cse36 .cse1)))) (let ((.cse37 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse37 .cse1)) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse38 .cse1)) (not (<= 5000000 .cse38)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse39 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse39 .cse1)) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse40 .cse1)) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (< .cse41 .cse1)) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse42 .cse1)) (not (<= 5000000 .cse42)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse43 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (not (< .cse43 .cse1)))) (let ((.cse44 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (not (< .cse44 .cse1)))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse45 .cse1)) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (not (< .cse46 .cse1)))))) is different from false [2022-04-07 23:14:23,641 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296))) (and (let ((.cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse0 .cse1)) (not (<= 5000000 .cse0)))) (let ((.cse2 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (not (< .cse2 .cse1)))) (let ((.cse3 (mod (+ 3 c_main_~x~0) 4294967296))) (or (not (< .cse3 .cse1)) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (<= 5000000 .cse4)) (not (< .cse4 .cse1)))) (let ((.cse5 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (not (< .cse5 .cse1)))) (let ((.cse6 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse6)) (not (< .cse6 .cse1)))) (let ((.cse7 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse7 .cse1)) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse8 .cse1)) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse9)) (not (< .cse9 .cse1)))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (not (< .cse10 .cse1)))) (let ((.cse11 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse11 .cse1)) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse12 .cse1)) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse13 .cse1)) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 6 c_main_~x~0) 4294967296))) (or (not (< .cse14 .cse1)) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (not (< .cse15 .cse1)))) (let ((.cse16 (mod (+ 36 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (not (< .cse16 .cse1)))) (let ((.cse17 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse17 .cse1)) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse18 .cse1)) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (< .cse19 .cse1)) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (not (< .cse20 .cse1)))) (let ((.cse21 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (not (< .cse21 .cse1)))) (let ((.cse22 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse22 .cse1)) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse23 .cse1)) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 39 c_main_~x~0) 4294967296))) (or (not (< .cse24 .cse1)) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 13 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (not (< .cse25 .cse1)))) (let ((.cse26 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (< .cse26 .cse1)) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 11) 4294967296))) (or (not (< .cse27 .cse1)) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse28 .cse1)) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (not (< .cse29 .cse1)))) (let ((.cse30 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (not (< .cse30 .cse1)))) (let ((.cse31 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (not (< .cse31 .cse1)))) (let ((.cse32 (mod (+ 16 c_main_~x~0) 4294967296))) (or (not (< .cse32 .cse1)) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse33)) (not (< .cse33 .cse1)))) (let ((.cse34 (mod (+ 17 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (not (< .cse34 .cse1)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (not (< .cse35 .cse1)))) (let ((.cse36 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (not (< .cse36 .cse1)))) (let ((.cse37 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse37 .cse1)) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse38 .cse1)) (not (<= 5000000 .cse38)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse39 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse39 .cse1)) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse40 .cse1)) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (< .cse41 .cse1)) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse42 .cse1)) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (not (< .cse43 .cse1)))) (let ((.cse44 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (not (< .cse44 .cse1)))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse45 .cse1)) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (not (< .cse46 .cse1)))))) is different from false [2022-04-07 23:14:25,736 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296))) (and (let ((.cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse0 .cse1)) (not (<= 5000000 .cse0)))) (let ((.cse2 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (<= 5000000 .cse2)) (not (< .cse2 .cse1)))) (let ((.cse3 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse3)) (not (< .cse3 .cse1)))) (let ((.cse4 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse4)) (not (< .cse4 .cse1)))) (let ((.cse5 (mod (+ 9 c_main_~x~0) 4294967296))) (or (not (< .cse5 .cse1)) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse6 .cse1)) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse7)) (not (< .cse7 .cse1)))) (let ((.cse8 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse8)) (not (< .cse8 .cse1)))) (let ((.cse9 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse9 .cse1)) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse10 .cse1)) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse11 .cse1)) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 6 c_main_~x~0) 4294967296))) (or (not (< .cse12 .cse1)) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse13)) (not (< .cse13 .cse1)))) (let ((.cse14 (mod (+ 36 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse14)) (not (< .cse14 .cse1)))) (let ((.cse15 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse15 .cse1)) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse16 .cse1)) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (< .cse17 .cse1)) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse18)) (not (< .cse18 .cse1)))) (let ((.cse19 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse19)) (not (< .cse19 .cse1)))) (let ((.cse20 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse20 .cse1)) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse21 .cse1)) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ 39 c_main_~x~0) 4294967296))) (or (not (< .cse22 .cse1)) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 13 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse23)) (not (< .cse23 .cse1)))) (let ((.cse24 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (< .cse24 .cse1)) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ c_main_~x~0 11) 4294967296))) (or (not (< .cse25 .cse1)) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse26 .cse1)) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse27)) (not (< .cse27 .cse1)))) (let ((.cse28 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse28)) (not (< .cse28 .cse1)))) (let ((.cse29 (mod (+ 16 c_main_~x~0) 4294967296))) (or (not (< .cse29 .cse1)) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (not (< .cse30 .cse1)))) (let ((.cse31 (mod (+ 17 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (not (< .cse31 .cse1)))) (let ((.cse32 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse32)) (not (< .cse32 .cse1)))) (let ((.cse33 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse33 .cse1)) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse34 .cse1)) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse35 .cse1)) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 7 c_main_~x~0) 4294967296))) (or (not (< .cse36 .cse1)) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (< .cse37 .cse1)) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse38 .cse1)) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse39)) (not (< .cse39 .cse1)))) (let ((.cse40 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse40)) (not (< .cse40 .cse1)))) (let ((.cse41 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse41 .cse1)) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse42)) (not (< .cse42 .cse1)))))) is different from false