/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/Mono3_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:49:29,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:49:29,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:49:29,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:49:29,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:49:29,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:49:29,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:49:29,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:49:29,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:49:29,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:49:29,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:49:29,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:49:29,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:49:29,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:49:29,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:49:29,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:49:29,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:49:29,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:49:29,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:49:29,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:49:29,873 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:49:29,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:49:29,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:49:29,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:49:29,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:49:29,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:49:29,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:49:29,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:49:29,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:49:29,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:49:29,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:49:29,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:49:29,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:49:29,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:49:29,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:49:29,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:49:29,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:49:29,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:49:29,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:49:29,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:49:29,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:49:29,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:49:29,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:49:29,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:49:29,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:49:29,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:49:29,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:49:29,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:49:29,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:49:29,911 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:49:29,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:49:29,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:49:29,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:49:29,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:49:29,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:49:29,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:49:29,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:49:29,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:49:29,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:49:29,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:49:29,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:49:29,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:49:29,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:49:29,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:49:29,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:49:29,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:49:29,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:49:29,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:49:29,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:49:29,914 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:49:29,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:49:29,915 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:49:29,915 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-15 00:49:30,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:49:30,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:49:30,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:49:30,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:49:30,110 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:49:30,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-04-15 00:49:30,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ee32156/dc3824892c62476da333011fe9c17d4f/FLAG2533b8b59 [2022-04-15 00:49:30,484 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:49:30,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-04-15 00:49:30,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ee32156/dc3824892c62476da333011fe9c17d4f/FLAG2533b8b59 [2022-04-15 00:49:30,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ee32156/dc3824892c62476da333011fe9c17d4f [2022-04-15 00:49:30,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:49:30,499 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:49:30,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:49:30,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:49:30,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:49:30,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5324fda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30, skipping insertion in model container [2022-04-15 00:49:30,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:49:30,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:49:30,644 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/Mono3_1.c[311,324] [2022-04-15 00:49:30,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:49:30,655 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:49:30,662 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/Mono3_1.c[311,324] [2022-04-15 00:49:30,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:49:30,671 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:49:30,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30 WrapperNode [2022-04-15 00:49:30,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:49:30,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:49:30,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:49:30,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:49:30,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:49:30,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:49:30,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:49:30,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:49:30,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:49:30,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:49:30,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 00:49:30,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 00:49:30,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:49:30,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:49:30,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:49:30,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:49:30,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:49:30,754 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:49:30,754 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:49:30,754 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:49:30,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:49:30,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:49:30,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:49:30,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:49:30,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:49:30,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:49:30,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:49:30,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:49:30,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:49:30,794 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:49:30,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:49:30,880 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:49:30,885 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:49:30,885 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:49:30,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:49:30 BoogieIcfgContainer [2022-04-15 00:49:30,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:49:30,887 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:49:30,887 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:49:30,887 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:49:30,889 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:49:30" (1/1) ... [2022-04-15 00:49:30,891 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:49:30,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:49:30 BasicIcfg [2022-04-15 00:49:30,903 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:49:30,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:49:30,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:49:30,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:49:30,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:49:30" (1/4) ... [2022-04-15 00:49:30,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4611821a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:49:30, skipping insertion in model container [2022-04-15 00:49:30,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:49:30" (2/4) ... [2022-04-15 00:49:30,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4611821a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:49:30, skipping insertion in model container [2022-04-15 00:49:30,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:49:30" (3/4) ... [2022-04-15 00:49:30,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4611821a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:49:30, skipping insertion in model container [2022-04-15 00:49:30,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:49:30" (4/4) ... [2022-04-15 00:49:30,908 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono3_1.cqvasr [2022-04-15 00:49:30,911 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:49:30,911 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:49:30,939 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:49:30,943 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-15 00:49:30,944 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:49:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-15 00:49:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:49:30,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:49:30,974 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:49:30,975 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:49:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:49:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash -154368955, now seen corresponding path program 1 times [2022-04-15 00:49:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:49:30,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607822251] [2022-04-15 00:49:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:49:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:49:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:31,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-15 00:49:31,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:49:31,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:49:31,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:49:31,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-15 00:49:31,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:49:31,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:49:31,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:49:31,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23#true} is VALID [2022-04-15 00:49:31,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [52] L9-2-->L9-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 00:49:31,173 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {24#false} is VALID [2022-04-15 00:49:31,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [59] __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] {24#false} is VALID [2022-04-15 00:49:31,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [61] 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[] {24#false} is VALID [2022-04-15 00:49:31,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 00:49:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:49:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:49:31,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607822251] [2022-04-15 00:49:31,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607822251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:49:31,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:49:31,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:49:31,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047734607] [2022-04-15 00:49:31,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:49:31,179 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-15 00:49:31,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:49:31,182 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-15 00:49:31,198 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-15 00:49:31,198 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:49:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:49:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:49:31,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:49:31,225 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-15 00:49:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:31,299 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 00:49:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:49:31,300 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-15 00:49:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:49:31,301 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-15 00:49:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 00:49:31,308 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-15 00:49:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 00:49:31,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-15 00:49:31,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:31,363 INFO L225 Difference]: With dead ends: 31 [2022-04-15 00:49:31,363 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 00:49:31,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:49:31,369 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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-15 00:49:31,370 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:49:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 00:49:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 00:49:31,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:49:31,394 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-15 00:49:31,394 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-15 00:49:31,394 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-15 00:49:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:31,396 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 00:49:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:49:31,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:31,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:31,397 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-15 00:49:31,397 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-15 00:49:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:31,400 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 00:49:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:49:31,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:31,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:31,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:49:31,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:49:31,401 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-15 00:49:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 00:49:31,403 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 00:49:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:49:31,403 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 00:49:31,404 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-15 00:49:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:49:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:49:31,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:49:31,404 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:49:31,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:49:31,405 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:49:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:49:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash -153445434, now seen corresponding path program 1 times [2022-04-15 00:49:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:49:31,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295014838] [2022-04-15 00:49:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:49:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:49:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:31,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {120#true} is VALID [2022-04-15 00:49:31,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:49:31,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:49:31,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:49:31,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {120#true} is VALID [2022-04-15 00:49:31,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:49:31,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:49:31,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:49:31,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {125#(= main_~x~0 0)} is VALID [2022-04-15 00:49:31,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(= main_~x~0 0)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-15 00:49:31,503 INFO L272 TraceCheckUtils]: 7: Hoare triple {121#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {121#false} is VALID [2022-04-15 00:49:31,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {121#false} [59] __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] {121#false} is VALID [2022-04-15 00:49:31,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {121#false} [61] 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[] {121#false} is VALID [2022-04-15 00:49:31,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-15 00:49:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:49:31,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:49:31,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295014838] [2022-04-15 00:49:31,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295014838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:49:31,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:49:31,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:49:31,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284499469] [2022-04-15 00:49:31,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:49:31,510 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-15 00:49:31,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:49:31,510 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-15 00:49:31,519 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-15 00:49:31,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:49:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:49:31,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:49:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:49:31,520 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-15 00:49:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:31,580 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 00:49:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 00:49:31,580 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-15 00:49:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:49:31,581 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-15 00:49:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 00:49:31,583 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-15 00:49:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 00:49:31,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-15 00:49:31,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:31,614 INFO L225 Difference]: With dead ends: 25 [2022-04-15 00:49:31,614 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 00:49:31,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:49:31,615 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-15 00:49:31,616 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-15 00:49:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 00:49:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 00:49:31,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:49:31,618 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-15 00:49:31,618 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-15 00:49:31,619 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-15 00:49:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:31,620 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 00:49:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 00:49:31,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:31,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:31,620 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-15 00:49:31,620 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-15 00:49:31,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:31,621 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 00:49:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 00:49:31,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:31,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:31,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:49:31,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:49:31,622 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-15 00:49:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 00:49:31,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-15 00:49:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:49:31,623 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 00:49:31,623 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-15 00:49:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 00:49:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:49:31,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:49:31,624 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:49:31,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:49:31,624 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:49:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:49:31,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1203653974, now seen corresponding path program 1 times [2022-04-15 00:49:31,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:49:31,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617617804] [2022-04-15 00:49:31,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:31,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:49:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:31,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:49:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:31,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {225#true} is VALID [2022-04-15 00:49:31,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:49:31,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {225#true} is VALID [2022-04-15 00:49:31,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {230#(= main_~x~0 0)} is VALID [2022-04-15 00:49:31,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {230#(= main_~x~0 0)} is VALID [2022-04-15 00:49:31,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {230#(= main_~x~0 0)} is VALID [2022-04-15 00:49:31,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {231#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:49:31,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-15 00:49:31,694 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {226#false} is VALID [2022-04-15 00:49:31,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} [59] __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] {226#false} is VALID [2022-04-15 00:49:31,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} [61] 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[] {226#false} is VALID [2022-04-15 00:49:31,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-15 00:49:31,695 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-15 00:49:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:49:31,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617617804] [2022-04-15 00:49:31,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617617804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:49:31,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419292892] [2022-04-15 00:49:31,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:31,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:31,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:49:31,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:49:31,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 00:49:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:31,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 00:49:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:31,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:49:31,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {225#true} is VALID [2022-04-15 00:49:31,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {251#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 00:49:31,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#(and (= main_~x~0 0) (= main_~y~0 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {251#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 00:49:31,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#(and (= main_~x~0 0) (= main_~y~0 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {258#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-15 00:49:31,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#(and (= main_~x~0 0) (= main_~y~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {262#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 00:49:31,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-15 00:49:31,829 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {226#false} is VALID [2022-04-15 00:49:31,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} [59] __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] {226#false} is VALID [2022-04-15 00:49:31,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} [61] 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[] {226#false} is VALID [2022-04-15 00:49:31,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-15 00:49:31,830 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-15 00:49:31,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:49:31,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-15 00:49:31,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(not (<= __VERIFIER_assert_~cond 0))} [61] 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[] {226#false} is VALID [2022-04-15 00:49:31,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {285#(< 0 |__VERIFIER_assert_#in~cond|)} [59] __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] {281#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:49:31,984 INFO L272 TraceCheckUtils]: 10: Hoare triple {289#(not (= (mod main_~y~0 4294967296) 0))} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {285#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:49:31,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod main_~x~0 4294967296) 1000000))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {289#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:31,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {293#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod main_~x~0 4294967296) 1000000))} is VALID [2022-04-15 00:49:31,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {297#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} is VALID [2022-04-15 00:49:31,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {301#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} is VALID [2022-04-15 00:49:31,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {301#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} is VALID [2022-04-15 00:49:31,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {225#true} is VALID [2022-04-15 00:49:31,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-15 00:49:31,988 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-15 00:49:31,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419292892] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:49:31,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:49:31,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 14 [2022-04-15 00:49:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619652593] [2022-04-15 00:49:31,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:49:31,989 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:49:31,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:49:31,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:32,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:32,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 00:49:32,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:49:32,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 00:49:32,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:49:32,010 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:32,374 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 00:49:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 00:49:32,374 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:49:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:49:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-15 00:49:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-15 00:49:32,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 44 transitions. [2022-04-15 00:49:32,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:32,417 INFO L225 Difference]: With dead ends: 37 [2022-04-15 00:49:32,417 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 00:49:32,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2022-04-15 00:49:32,419 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:49:32,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 41 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:49:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 00:49:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-04-15 00:49:32,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:49:32,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-15 00:49:32,423 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-15 00:49:32,423 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-15 00:49:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:32,424 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 00:49:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 00:49:32,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:32,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:32,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 25 states. [2022-04-15 00:49:32,425 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 25 states. [2022-04-15 00:49:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:32,426 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 00:49:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 00:49:32,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:32,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:32,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:49:32,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:49:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-15 00:49:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-15 00:49:32,427 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-15 00:49:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:49:32,427 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-15 00:49:32,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 00:49:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 00:49:32,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:49:32,428 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:49:32,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 00:49:32,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:32,646 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:49:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:49:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2025124503, now seen corresponding path program 1 times [2022-04-15 00:49:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:49:32,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539326685] [2022-04-15 00:49:32,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:32,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:49:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:49:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:32,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {482#true} is VALID [2022-04-15 00:49:32,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:32,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {482#true} {482#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:32,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:49:32,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {482#true} is VALID [2022-04-15 00:49:32,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:32,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:32,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:32,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {487#(= main_~x~0 0)} is VALID [2022-04-15 00:49:32,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {487#(= main_~x~0 0)} is VALID [2022-04-15 00:49:32,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {487#(= main_~x~0 0)} is VALID [2022-04-15 00:49:32,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:32,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:32,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:32,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {489#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:32,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {489#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:32,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {483#false} is VALID [2022-04-15 00:49:32,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {483#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {483#false} is VALID [2022-04-15 00:49:32,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {483#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {483#false} is VALID [2022-04-15 00:49:32,759 INFO L272 TraceCheckUtils]: 16: Hoare triple {483#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {483#false} is VALID [2022-04-15 00:49:32,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {483#false} [59] __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] {483#false} is VALID [2022-04-15 00:49:32,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {483#false} [61] 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[] {483#false} is VALID [2022-04-15 00:49:32,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#false} is VALID [2022-04-15 00:49:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:49:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:49:32,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539326685] [2022-04-15 00:49:32,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539326685] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:49:32,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931491788] [2022-04-15 00:49:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:32,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:32,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:49:32,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:49:32,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:49:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:32,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 00:49:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:32,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:49:32,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:32,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {482#true} is VALID [2022-04-15 00:49:32,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:32,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:32,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:32,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {509#(= main_~y~0 0)} is VALID [2022-04-15 00:49:32,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#(= main_~y~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {509#(= main_~y~0 0)} is VALID [2022-04-15 00:49:32,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {509#(= main_~y~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:32,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:32,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:32,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {526#(= main_~y~0 2)} is VALID [2022-04-15 00:49:32,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {526#(= main_~y~0 2)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {526#(= main_~y~0 2)} is VALID [2022-04-15 00:49:32,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#(= main_~y~0 2)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {526#(= main_~y~0 2)} is VALID [2022-04-15 00:49:32,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {526#(= main_~y~0 2)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:32,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:32,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:32,948 INFO L272 TraceCheckUtils]: 16: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:49:32,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __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] {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:49:32,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} [61] 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[] {483#false} is VALID [2022-04-15 00:49:32,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#false} is VALID [2022-04-15 00:49:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 00:49:32,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:49:33,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {483#false} is VALID [2022-04-15 00:49:33,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} [61] 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[] {483#false} is VALID [2022-04-15 00:49:33,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __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] {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:49:33,113 INFO L272 TraceCheckUtils]: 16: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:49:33,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:33,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:33,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:33,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:49:33,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:49:33,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:49:33,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:33,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:33,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {594#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:33,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {594#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {594#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-15 00:49:33,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {594#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-15 00:49:33,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:33,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:33,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:33,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {482#true} is VALID [2022-04-15 00:49:33,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#true} is VALID [2022-04-15 00:49:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 00:49:33,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931491788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:49:33,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:49:33,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-04-15 00:49:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904030171] [2022-04-15 00:49:33,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:49:33,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 00:49:33,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:49:33,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:33,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:33,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 00:49:33,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:49:33,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 00:49:33,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:49:33,169 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:33,726 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-04-15 00:49:33,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 00:49:33,726 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 00:49:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:49:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-15 00:49:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-15 00:49:33,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 65 transitions. [2022-04-15 00:49:33,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:33,794 INFO L225 Difference]: With dead ends: 59 [2022-04-15 00:49:33,794 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 00:49:33,795 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-04-15 00:49:33,795 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:49:33,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 62 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:49:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 00:49:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-15 00:49:33,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:49:33,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-15 00:49:33,813 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-15 00:49:33,813 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-15 00:49:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:33,814 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-15 00:49:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-15 00:49:33,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:33,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:33,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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 45 states. [2022-04-15 00:49:33,815 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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 45 states. [2022-04-15 00:49:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:33,816 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-15 00:49:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-15 00:49:33,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:33,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:33,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:49:33,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:49:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-15 00:49:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-15 00:49:33,818 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 20 [2022-04-15 00:49:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:49:33,818 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-15 00:49:33,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-15 00:49:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 00:49:33,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:49:33,819 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:49:33,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 00:49:34,032 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 00:49:34,033 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:49:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:49:34,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1905741238, now seen corresponding path program 2 times [2022-04-15 00:49:34,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:49:34,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499951022] [2022-04-15 00:49:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:49:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:34,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:49:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:34,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {880#true} is VALID [2022-04-15 00:49:34,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:49:34,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {880#true} is VALID [2022-04-15 00:49:34,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {885#(= main_~x~0 0)} is VALID [2022-04-15 00:49:34,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {885#(= main_~x~0 0)} is VALID [2022-04-15 00:49:34,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {885#(= main_~x~0 0)} is VALID [2022-04-15 00:49:34,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:34,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:34,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:34,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:34,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:34,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:34,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {888#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 00:49:34,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {888#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {888#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 00:49:34,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {888#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {881#false} is VALID [2022-04-15 00:49:34,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {881#false} is VALID [2022-04-15 00:49:34,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {881#false} is VALID [2022-04-15 00:49:34,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {881#false} is VALID [2022-04-15 00:49:34,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {881#false} is VALID [2022-04-15 00:49:34,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {881#false} is VALID [2022-04-15 00:49:34,120 INFO L272 TraceCheckUtils]: 22: Hoare triple {881#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {881#false} is VALID [2022-04-15 00:49:34,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#false} [59] __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] {881#false} is VALID [2022-04-15 00:49:34,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} [61] 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[] {881#false} is VALID [2022-04-15 00:49:34,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {881#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#false} is VALID [2022-04-15 00:49:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 00:49:34,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:49:34,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499951022] [2022-04-15 00:49:34,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499951022] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:49:34,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795930922] [2022-04-15 00:49:34,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:49:34,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:34,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:49:34,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:49:34,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 00:49:34,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:49:34,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:49:34,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 00:49:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:34,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:49:34,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {880#true} is VALID [2022-04-15 00:49:34,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {908#(= main_~y~0 0)} is VALID [2022-04-15 00:49:34,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {908#(= main_~y~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {908#(= main_~y~0 0)} is VALID [2022-04-15 00:49:34,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {908#(= main_~y~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {935#(= (+ main_~y~0 (- 3)) 0)} is VALID [2022-04-15 00:49:34,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {935#(= (+ main_~y~0 (- 3)) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {935#(= (+ main_~y~0 (- 3)) 0)} is VALID [2022-04-15 00:49:34,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {935#(= (+ main_~y~0 (- 3)) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {935#(= (+ main_~y~0 (- 3)) 0)} is VALID [2022-04-15 00:49:34,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {935#(= (+ main_~y~0 (- 3)) 0)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:49:34,277 INFO L272 TraceCheckUtils]: 22: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:49:34,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __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] {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:49:34,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} [61] 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[] {881#false} is VALID [2022-04-15 00:49:34,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {881#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#false} is VALID [2022-04-15 00:49:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 00:49:34,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:49:34,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {881#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {881#false} is VALID [2022-04-15 00:49:34,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} [61] 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[] {881#false} is VALID [2022-04-15 00:49:34,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __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] {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:49:34,440 INFO L272 TraceCheckUtils]: 22: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:49:34,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:34,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:34,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:34,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:49:34,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:49:34,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:49:34,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 00:49:34,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 00:49:34,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 00:49:34,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:49:34,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:49:34,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:49:34,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:34,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:34,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {1031#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:49:34,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1031#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-15 00:49:34,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1031#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-15 00:49:34,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {880#true} is VALID [2022-04-15 00:49:34,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {880#true} is VALID [2022-04-15 00:49:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 00:49:34,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795930922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:49:34,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:49:34,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-04-15 00:49:34,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330852220] [2022-04-15 00:49:34,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:49:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 00:49:34,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:49:34,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:34,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:34,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 00:49:34,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:49:34,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 00:49:34,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-15 00:49:34,496 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:35,286 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2022-04-15 00:49:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 00:49:35,286 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 00:49:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:49:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 88 transitions. [2022-04-15 00:49:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 88 transitions. [2022-04-15 00:49:35,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 88 transitions. [2022-04-15 00:49:35,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:35,386 INFO L225 Difference]: With dead ends: 110 [2022-04-15 00:49:35,386 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 00:49:35,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 00:49:35,387 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:49:35,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 54 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:49:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 00:49:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2022-04-15 00:49:35,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:49:35,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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-15 00:49:35,407 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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-15 00:49:35,407 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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-15 00:49:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:35,409 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-04-15 00:49:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-04-15 00:49:35,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:35,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:35,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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 80 states. [2022-04-15 00:49:35,410 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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 80 states. [2022-04-15 00:49:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:35,411 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-04-15 00:49:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-04-15 00:49:35,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:35,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:35,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:49:35,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:49:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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-15 00:49:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-04-15 00:49:35,413 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 26 [2022-04-15 00:49:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:49:35,413 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-04-15 00:49:35,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-15 00:49:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 00:49:35,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:49:35,414 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:49:35,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 00:49:35,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:35,632 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:49:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:49:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash 81509943, now seen corresponding path program 3 times [2022-04-15 00:49:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:49:35,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676626040] [2022-04-15 00:49:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:49:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:35,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:49:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:35,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1492#true} is VALID [2022-04-15 00:49:35,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:35,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1492#true} {1492#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:35,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:49:35,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1492#true} is VALID [2022-04-15 00:49:35,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:35,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:35,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:35,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1497#(= main_~x~0 0)} is VALID [2022-04-15 00:49:35,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {1497#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1497#(= main_~x~0 0)} is VALID [2022-04-15 00:49:35,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {1497#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1497#(= main_~x~0 0)} is VALID [2022-04-15 00:49:35,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {1497#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:35,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:35,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:35,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:35,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:35,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:35,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:35,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:35,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:35,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1501#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:49:35,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {1501#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1501#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:49:35,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {1501#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1493#false} is VALID [2022-04-15 00:49:35,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {1493#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1493#false} is VALID [2022-04-15 00:49:35,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {1493#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1493#false} is VALID [2022-04-15 00:49:35,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {1493#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1493#false} is VALID [2022-04-15 00:49:35,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {1493#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1493#false} is VALID [2022-04-15 00:49:35,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {1493#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1493#false} is VALID [2022-04-15 00:49:35,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {1493#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1493#false} is VALID [2022-04-15 00:49:35,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {1493#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1493#false} is VALID [2022-04-15 00:49:35,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {1493#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1493#false} is VALID [2022-04-15 00:49:35,784 INFO L272 TraceCheckUtils]: 28: Hoare triple {1493#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {1493#false} is VALID [2022-04-15 00:49:35,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {1493#false} [59] __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] {1493#false} is VALID [2022-04-15 00:49:35,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {1493#false} [61] 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[] {1493#false} is VALID [2022-04-15 00:49:35,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {1493#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1493#false} is VALID [2022-04-15 00:49:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 00:49:35,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:49:35,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676626040] [2022-04-15 00:49:35,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676626040] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:49:35,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235572254] [2022-04-15 00:49:35,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 00:49:35,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:35,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:49:35,787 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:49:35,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 00:49:35,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-15 00:49:35,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:49:35,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 00:49:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:35,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:49:36,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1492#true} is VALID [2022-04-15 00:49:36,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1492#true} is VALID [2022-04-15 00:49:36,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {1492#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {1492#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1492#true} is VALID [2022-04-15 00:49:36,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {1492#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1492#true} is VALID [2022-04-15 00:49:36,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {1492#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {1492#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1492#true} is VALID [2022-04-15 00:49:36,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {1492#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1492#true} is VALID [2022-04-15 00:49:36,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1492#true} is VALID [2022-04-15 00:49:36,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {1492#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1492#true} is VALID [2022-04-15 00:49:36,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {1492#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {1492#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1554#(< (mod main_~x~0 4294967296) 500000)} is VALID [2022-04-15 00:49:36,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(< (mod main_~x~0 4294967296) 500000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1588#(< (mod (+ 4294967292 main_~x~0) 4294967296) 500000)} is VALID [2022-04-15 00:49:36,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {1588#(< (mod (+ 4294967292 main_~x~0) 4294967296) 500000)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1493#false} is VALID [2022-04-15 00:49:36,119 INFO L272 TraceCheckUtils]: 28: Hoare triple {1493#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {1493#false} is VALID [2022-04-15 00:49:36,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {1493#false} [59] __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] {1493#false} is VALID [2022-04-15 00:49:36,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {1493#false} [61] 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[] {1493#false} is VALID [2022-04-15 00:49:36,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {1493#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1493#false} is VALID [2022-04-15 00:49:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 00:49:36,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:49:36,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {1493#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1493#false} is VALID [2022-04-15 00:49:36,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {1493#false} [61] 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[] {1493#false} is VALID [2022-04-15 00:49:36,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {1493#false} [59] __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] {1493#false} is VALID [2022-04-15 00:49:36,435 INFO L272 TraceCheckUtils]: 28: Hoare triple {1493#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {1493#false} is VALID [2022-04-15 00:49:36,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {1616#(< (mod main_~x~0 4294967296) 1000000)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1493#false} is VALID [2022-04-15 00:49:36,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1616#(< (mod main_~x~0 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {1650#(< (mod (+ main_~x~0 4) 4294967296) 1000000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {1492#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1650#(< (mod (+ main_~x~0 4) 4294967296) 1000000)} is VALID [2022-04-15 00:49:36,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {1492#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {1492#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1492#true} is VALID [2022-04-15 00:49:36,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1492#true} is VALID [2022-04-15 00:49:36,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {1492#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {1492#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {1492#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {1492#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {1492#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {1492#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1492#true} is VALID [2022-04-15 00:49:36,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1492#true} is VALID [2022-04-15 00:49:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 00:49:36,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235572254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:49:36,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:49:36,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-15 00:49:36,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774464106] [2022-04-15 00:49:36,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:49:36,443 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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 32 [2022-04-15 00:49:36,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:49:36,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-15 00:49:36,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:36,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 00:49:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:49:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 00:49:36,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-04-15 00:49:36,481 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-15 00:49:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:38,100 INFO L93 Difference]: Finished difference Result 148 states and 200 transitions. [2022-04-15 00:49:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 00:49:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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 32 [2022-04-15 00:49:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:49:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-15 00:49:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2022-04-15 00:49:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-15 00:49:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2022-04-15 00:49:38,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2022-04-15 00:49:38,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:38,282 INFO L225 Difference]: With dead ends: 148 [2022-04-15 00:49:38,282 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 00:49:38,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=477, Invalid=1083, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 00:49:38,283 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 166 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:49:38,283 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 38 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:49:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 00:49:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 57. [2022-04-15 00:49:38,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:49:38,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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-15 00:49:38,310 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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-15 00:49:38,310 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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-15 00:49:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:38,313 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-15 00:49:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-15 00:49:38,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:38,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:38,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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 109 states. [2022-04-15 00:49:38,313 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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 109 states. [2022-04-15 00:49:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:38,316 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-15 00:49:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-15 00:49:38,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:38,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:38,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:49:38,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:49:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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-15 00:49:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-04-15 00:49:38,317 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 32 [2022-04-15 00:49:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:49:38,317 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-04-15 00:49:38,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-15 00:49:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-04-15 00:49:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 00:49:38,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:49:38,318 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:49:38,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 00:49:38,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:38,523 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:49:38,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:49:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash -912098025, now seen corresponding path program 4 times [2022-04-15 00:49:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:49:38,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945009021] [2022-04-15 00:49:38,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:49:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:49:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:38,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {2267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2255#true} is VALID [2022-04-15 00:49:38,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2255#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:38,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2255#true} {2255#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:38,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {2255#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:49:38,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2255#true} is VALID [2022-04-15 00:49:38,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {2255#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:38,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2255#true} {2255#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:38,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {2255#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:38,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {2255#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2260#(= main_~x~0 0)} is VALID [2022-04-15 00:49:38,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {2260#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2260#(= main_~x~0 0)} is VALID [2022-04-15 00:49:38,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2260#(= main_~x~0 0)} is VALID [2022-04-15 00:49:38,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:38,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:38,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:38,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:38,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:38,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:38,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:38,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:38,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:38,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:49:38,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:49:38,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:49:38,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 00:49:38,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 00:49:38,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 00:49:38,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 00:49:38,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {2266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 00:49:38,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {2266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:38,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:38,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:38,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,743 INFO L290 TraceCheckUtils]: 46: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,743 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:38,743 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:38,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {2256#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,747 INFO L272 TraceCheckUtils]: 52: Hoare triple {2256#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:38,747 INFO L290 TraceCheckUtils]: 53: Hoare triple {2256#false} [59] __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] {2256#false} is VALID [2022-04-15 00:49:38,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {2256#false} [61] 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[] {2256#false} is VALID [2022-04-15 00:49:38,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {2256#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 173 proven. 57 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 00:49:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:49:38,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945009021] [2022-04-15 00:49:38,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945009021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:49:38,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389982986] [2022-04-15 00:49:38,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 00:49:38,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:38,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:49:38,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:49:38,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 00:49:38,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 00:49:38,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:49:38,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 00:49:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:38,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:49:39,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {2255#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:39,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {2255#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2255#true} is VALID [2022-04-15 00:49:39,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {2255#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:39,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2255#true} {2255#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:39,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {2255#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:39,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {2255#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2260#(= main_~x~0 0)} is VALID [2022-04-15 00:49:39,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {2260#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2260#(= main_~x~0 0)} is VALID [2022-04-15 00:49:39,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2260#(= main_~x~0 0)} is VALID [2022-04-15 00:49:39,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:39,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:39,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:39,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:39,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:39,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:39,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:39,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:39,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:39,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:49:39,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:49:39,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:49:39,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 00:49:39,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 00:49:39,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 00:49:39,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 00:49:39,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 00:49:39,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 00:49:39,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 00:49:39,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 00:49:39,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 00:49:39,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 00:49:39,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 00:49:39,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 00:49:39,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 00:49:39,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 00:49:39,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 00:49:39,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 00:49:39,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 00:49:39,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 00:49:39,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 00:49:39,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 00:49:39,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 00:49:39,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2400#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 00:49:39,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {2400#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2400#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 00:49:39,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {2400#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:39,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:39,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:39,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {2256#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L272 TraceCheckUtils]: 52: Hoare triple {2256#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {2256#false} [59] __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] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {2256#false} [61] 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[] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {2256#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 00:49:39,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:49:40,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {2256#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:40,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {2256#false} [61] 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[] {2256#false} is VALID [2022-04-15 00:49:40,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {2256#false} [59] __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] {2256#false} is VALID [2022-04-15 00:49:40,159 INFO L272 TraceCheckUtils]: 52: Hoare triple {2256#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:40,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {2256#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:40,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:40,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:40,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:40,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:40,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {2256#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:40,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {2256#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#false} is VALID [2022-04-15 00:49:40,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2256#false} is VALID [2022-04-15 00:49:40,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {2479#(< (mod main_~x~0 4294967296) 500000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2256#false} is VALID [2022-04-15 00:49:40,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {2483#(or (< (mod main_~x~0 4294967296) 500000) (not (< (mod main_~x~0 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2479#(< (mod main_~x~0 4294967296) 500000)} is VALID [2022-04-15 00:49:40,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2483#(or (< (mod main_~x~0 4294967296) 500000) (not (< (mod main_~x~0 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} is VALID [2022-04-15 00:49:40,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {2255#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} is VALID [2022-04-15 00:49:40,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {2255#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:40,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2255#true} {2255#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:40,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2255#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:40,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {2255#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2255#true} is VALID [2022-04-15 00:49:40,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {2255#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2255#true} is VALID [2022-04-15 00:49:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 00:49:40,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389982986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:49:40,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:49:40,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 31 [2022-04-15 00:49:40,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109338731] [2022-04-15 00:49:40,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:49:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-15 00:49:40,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:49:40,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-15 00:49:40,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:40,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 00:49:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:49:40,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 00:49:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2022-04-15 00:49:40,263 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-15 00:49:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:51,141 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2022-04-15 00:49:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 00:49:51,141 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-15 00:49:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:49:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-15 00:49:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-15 00:49:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-15 00:49:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-15 00:49:51,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 122 transitions. [2022-04-15 00:49:51,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:51,266 INFO L225 Difference]: With dead ends: 151 [2022-04-15 00:49:51,266 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 00:49:51,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=924, Invalid=2382, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 00:49:51,268 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 205 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 00:49:51,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 84 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 00:49:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 00:49:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-04-15 00:49:51,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:49:51,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-15 00:49:51,371 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-15 00:49:51,372 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-15 00:49:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:51,374 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-04-15 00:49:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-04-15 00:49:51,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:51,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:51,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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 117 states. [2022-04-15 00:49:51,374 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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 117 states. [2022-04-15 00:49:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:51,376 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-04-15 00:49:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-04-15 00:49:51,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:51,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:51,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:49:51,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:49:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-15 00:49:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2022-04-15 00:49:51,379 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 56 [2022-04-15 00:49:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:49:51,379 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2022-04-15 00:49:51,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-15 00:49:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-04-15 00:49:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 00:49:51,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:49:51,391 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:49:51,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 00:49:51,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:51,597 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:49:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:49:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2051530473, now seen corresponding path program 5 times [2022-04-15 00:49:51,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:49:51,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175941147] [2022-04-15 00:49:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:51,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:49:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:49:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:52,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {3308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3276#true} is VALID [2022-04-15 00:49:52,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {3276#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:49:52,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3276#true} {3276#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:49:52,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {3276#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:49:52,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {3308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3276#true} is VALID [2022-04-15 00:49:52,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {3276#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:49:52,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3276#true} {3276#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:49:52,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {3276#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:49:52,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {3276#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3281#(= main_~x~0 0)} is VALID [2022-04-15 00:49:52,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {3281#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3281#(= main_~x~0 0)} is VALID [2022-04-15 00:49:52,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {3281#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3281#(= main_~x~0 0)} is VALID [2022-04-15 00:49:52,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {3281#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:52,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:52,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:49:52,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:52,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:52,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:49:52,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:52,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:52,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:49:52,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:49:52,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:49:52,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:49:52,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 00:49:52,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 00:49:52,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 00:49:52,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 00:49:52,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 00:49:52,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 00:49:52,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 00:49:52,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 00:49:52,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 00:49:52,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 00:49:52,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 00:49:52,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 00:49:52,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 00:49:52,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 00:49:52,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 00:49:52,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 00:49:52,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 00:49:52,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 00:49:52,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 00:49:52,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 00:49:52,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 00:49:52,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 00:49:52,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 00:49:52,307 INFO L290 TraceCheckUtils]: 43: Hoare triple {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 00:49:52,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 00:49:52,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 00:49:52,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 00:49:52,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 00:49:52,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 00:49:52,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 00:49:52,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 00:49:52,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 00:49:52,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 00:49:52,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 00:49:52,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 00:49:52,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 00:49:52,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 00:49:52,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 00:49:52,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 00:49:52,313 INFO L290 TraceCheckUtils]: 59: Hoare triple {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 00:49:52,313 INFO L290 TraceCheckUtils]: 60: Hoare triple {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 00:49:52,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 00:49:52,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 00:49:52,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 00:49:52,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 00:49:52,315 INFO L290 TraceCheckUtils]: 65: Hoare triple {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 00:49:52,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 00:49:52,316 INFO L290 TraceCheckUtils]: 67: Hoare triple {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 00:49:52,316 INFO L290 TraceCheckUtils]: 68: Hoare triple {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 00:49:52,316 INFO L290 TraceCheckUtils]: 69: Hoare triple {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 00:49:52,317 INFO L290 TraceCheckUtils]: 70: Hoare triple {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 00:49:52,317 INFO L290 TraceCheckUtils]: 71: Hoare triple {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 00:49:52,317 INFO L290 TraceCheckUtils]: 72: Hoare triple {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 00:49:52,318 INFO L290 TraceCheckUtils]: 73: Hoare triple {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 00:49:52,318 INFO L290 TraceCheckUtils]: 74: Hoare triple {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 00:49:52,319 INFO L290 TraceCheckUtils]: 75: Hoare triple {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 00:49:52,319 INFO L290 TraceCheckUtils]: 76: Hoare triple {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 00:49:52,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 00:49:52,320 INFO L290 TraceCheckUtils]: 78: Hoare triple {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 00:49:52,320 INFO L290 TraceCheckUtils]: 79: Hoare triple {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 00:49:52,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 00:49:52,321 INFO L290 TraceCheckUtils]: 81: Hoare triple {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 00:49:52,321 INFO L290 TraceCheckUtils]: 82: Hoare triple {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 00:49:52,322 INFO L290 TraceCheckUtils]: 83: Hoare triple {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3307#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 00:49:52,322 INFO L290 TraceCheckUtils]: 84: Hoare triple {3307#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3307#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 85: Hoare triple {3307#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 86: Hoare triple {3277#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 87: Hoare triple {3277#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 88: Hoare triple {3277#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 89: Hoare triple {3277#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 90: Hoare triple {3277#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 91: Hoare triple {3277#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 92: Hoare triple {3277#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 93: Hoare triple {3277#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 94: Hoare triple {3277#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 95: Hoare triple {3277#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 96: Hoare triple {3277#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 97: Hoare triple {3277#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 98: Hoare triple {3277#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#false} is VALID [2022-04-15 00:49:52,323 INFO L290 TraceCheckUtils]: 99: Hoare triple {3277#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 100: Hoare triple {3277#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 101: Hoare triple {3277#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 102: Hoare triple {3277#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 103: Hoare triple {3277#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 104: Hoare triple {3277#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 105: Hoare triple {3277#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 106: Hoare triple {3277#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 107: Hoare triple {3277#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 108: Hoare triple {3277#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 109: Hoare triple {3277#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 110: Hoare triple {3277#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 111: Hoare triple {3277#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L272 TraceCheckUtils]: 112: Hoare triple {3277#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 113: Hoare triple {3277#false} [59] __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] {3277#false} is VALID [2022-04-15 00:49:52,324 INFO L290 TraceCheckUtils]: 114: Hoare triple {3277#false} [61] 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[] {3277#false} is VALID [2022-04-15 00:49:52,325 INFO L290 TraceCheckUtils]: 115: Hoare triple {3277#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:49:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 693 proven. 1027 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 00:49:52,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:49:52,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175941147] [2022-04-15 00:49:52,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175941147] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:49:52,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412699529] [2022-04-15 00:49:52,326 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-15 00:49:52,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:49:52,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:49:52,327 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:49:52,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 00:49:59,625 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2022-04-15 00:49:59,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:49:59,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-15 00:49:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:59,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:50:01,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {3276#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:50:01,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {3276#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3276#true} is VALID [2022-04-15 00:50:01,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {3276#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:50:01,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3276#true} {3276#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:50:01,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {3276#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:50:01,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {3276#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3327#(= main_~y~0 0)} is VALID [2022-04-15 00:50:01,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {3327#(= main_~y~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3327#(= main_~y~0 0)} is VALID [2022-04-15 00:50:01,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {3327#(= main_~y~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3334#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:50:01,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {3334#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3334#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:50:01,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {3334#(= (+ (- 1) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3334#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:50:01,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {3334#(= (+ (- 1) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3344#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-15 00:50:01,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {3344#(= (+ (- 2) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3344#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-15 00:50:01,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {3344#(= (+ (- 2) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3344#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-15 00:50:01,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {3344#(= (+ (- 2) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3354#(= main_~y~0 3)} is VALID [2022-04-15 00:50:01,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {3354#(= main_~y~0 3)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3354#(= main_~y~0 3)} is VALID [2022-04-15 00:50:01,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {3354#(= main_~y~0 3)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3354#(= main_~y~0 3)} is VALID [2022-04-15 00:50:01,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {3354#(= main_~y~0 3)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3364#(= 3 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {3364#(= 3 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3364#(= 3 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {3364#(= 3 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3364#(= 3 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {3364#(= 3 (+ (- 1) main_~y~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3374#(= 5 main_~y~0)} is VALID [2022-04-15 00:50:01,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {3374#(= 5 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3374#(= 5 main_~y~0)} is VALID [2022-04-15 00:50:01,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {3374#(= 5 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3374#(= 5 main_~y~0)} is VALID [2022-04-15 00:50:01,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {3374#(= 5 main_~y~0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3384#(= main_~y~0 6)} is VALID [2022-04-15 00:50:01,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {3384#(= main_~y~0 6)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3384#(= main_~y~0 6)} is VALID [2022-04-15 00:50:01,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {3384#(= main_~y~0 6)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3384#(= main_~y~0 6)} is VALID [2022-04-15 00:50:01,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {3384#(= main_~y~0 6)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3394#(= 7 main_~y~0)} is VALID [2022-04-15 00:50:01,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {3394#(= 7 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3394#(= 7 main_~y~0)} is VALID [2022-04-15 00:50:01,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {3394#(= 7 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3394#(= 7 main_~y~0)} is VALID [2022-04-15 00:50:01,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {3394#(= 7 main_~y~0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3404#(and (< (mod main_~x~0 4294967296) 500000) (= main_~y~0 8))} is VALID [2022-04-15 00:50:01,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {3404#(and (< (mod main_~x~0 4294967296) 500000) (= main_~y~0 8))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3408#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} is VALID [2022-04-15 00:50:01,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {3408#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3408#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} is VALID [2022-04-15 00:50:01,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {3408#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3415#(= main_~y~0 9)} is VALID [2022-04-15 00:50:01,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {3415#(= main_~y~0 9)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3415#(= main_~y~0 9)} is VALID [2022-04-15 00:50:01,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {3415#(= main_~y~0 9)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3415#(= main_~y~0 9)} is VALID [2022-04-15 00:50:01,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {3415#(= main_~y~0 9)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3425#(= 9 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {3425#(= 9 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3425#(= 9 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {3425#(= 9 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3425#(= 9 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {3425#(= 9 (+ (- 1) main_~y~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3435#(= main_~y~0 11)} is VALID [2022-04-15 00:50:01,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {3435#(= main_~y~0 11)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3435#(= main_~y~0 11)} is VALID [2022-04-15 00:50:01,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {3435#(= main_~y~0 11)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3435#(= main_~y~0 11)} is VALID [2022-04-15 00:50:01,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {3435#(= main_~y~0 11)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3445#(= (+ (- 1) main_~y~0) 11)} is VALID [2022-04-15 00:50:01,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {3445#(= (+ (- 1) main_~y~0) 11)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3445#(= (+ (- 1) main_~y~0) 11)} is VALID [2022-04-15 00:50:01,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {3445#(= (+ (- 1) main_~y~0) 11)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3445#(= (+ (- 1) main_~y~0) 11)} is VALID [2022-04-15 00:50:01,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {3445#(= (+ (- 1) main_~y~0) 11)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3455#(= main_~y~0 13)} is VALID [2022-04-15 00:50:01,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {3455#(= main_~y~0 13)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3455#(= main_~y~0 13)} is VALID [2022-04-15 00:50:01,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {3455#(= main_~y~0 13)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3455#(= main_~y~0 13)} is VALID [2022-04-15 00:50:01,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {3455#(= main_~y~0 13)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3465#(= (+ (- 1) main_~y~0) 13)} is VALID [2022-04-15 00:50:01,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {3465#(= (+ (- 1) main_~y~0) 13)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3465#(= (+ (- 1) main_~y~0) 13)} is VALID [2022-04-15 00:50:01,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {3465#(= (+ (- 1) main_~y~0) 13)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3465#(= (+ (- 1) main_~y~0) 13)} is VALID [2022-04-15 00:50:01,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {3465#(= (+ (- 1) main_~y~0) 13)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3475#(= main_~y~0 15)} is VALID [2022-04-15 00:50:01,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {3475#(= main_~y~0 15)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3475#(= main_~y~0 15)} is VALID [2022-04-15 00:50:01,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {3475#(= main_~y~0 15)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3475#(= main_~y~0 15)} is VALID [2022-04-15 00:50:01,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {3475#(= main_~y~0 15)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3485#(= 15 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,273 INFO L290 TraceCheckUtils]: 53: Hoare triple {3485#(= 15 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3485#(= 15 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {3485#(= 15 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3485#(= 15 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,273 INFO L290 TraceCheckUtils]: 55: Hoare triple {3485#(= 15 (+ (- 1) main_~y~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-15 00:50:01,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-15 00:50:01,274 INFO L290 TraceCheckUtils]: 57: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-15 00:50:01,274 INFO L290 TraceCheckUtils]: 58: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3505#(= main_~y~0 18)} is VALID [2022-04-15 00:50:01,274 INFO L290 TraceCheckUtils]: 59: Hoare triple {3505#(= main_~y~0 18)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3505#(= main_~y~0 18)} is VALID [2022-04-15 00:50:01,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {3505#(= main_~y~0 18)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3505#(= main_~y~0 18)} is VALID [2022-04-15 00:50:01,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {3505#(= main_~y~0 18)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3515#(= 19 main_~y~0)} is VALID [2022-04-15 00:50:01,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {3515#(= 19 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3515#(= 19 main_~y~0)} is VALID [2022-04-15 00:50:01,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {3515#(= 19 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3515#(= 19 main_~y~0)} is VALID [2022-04-15 00:50:01,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {3515#(= 19 main_~y~0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3535#(= main_~y~0 21)} is VALID [2022-04-15 00:50:01,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {3535#(= main_~y~0 21)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3535#(= main_~y~0 21)} is VALID [2022-04-15 00:50:01,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {3535#(= main_~y~0 21)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3535#(= main_~y~0 21)} is VALID [2022-04-15 00:50:01,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {3535#(= main_~y~0 21)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3545#(= main_~y~0 22)} is VALID [2022-04-15 00:50:01,277 INFO L290 TraceCheckUtils]: 71: Hoare triple {3545#(= main_~y~0 22)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3545#(= main_~y~0 22)} is VALID [2022-04-15 00:50:01,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {3545#(= main_~y~0 22)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3545#(= main_~y~0 22)} is VALID [2022-04-15 00:50:01,277 INFO L290 TraceCheckUtils]: 73: Hoare triple {3545#(= main_~y~0 22)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3555#(= 23 main_~y~0)} is VALID [2022-04-15 00:50:01,277 INFO L290 TraceCheckUtils]: 74: Hoare triple {3555#(= 23 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3555#(= 23 main_~y~0)} is VALID [2022-04-15 00:50:01,277 INFO L290 TraceCheckUtils]: 75: Hoare triple {3555#(= 23 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3555#(= 23 main_~y~0)} is VALID [2022-04-15 00:50:01,278 INFO L290 TraceCheckUtils]: 76: Hoare triple {3555#(= 23 main_~y~0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3565#(= main_~y~0 24)} is VALID [2022-04-15 00:50:01,278 INFO L290 TraceCheckUtils]: 77: Hoare triple {3565#(= main_~y~0 24)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3565#(= main_~y~0 24)} is VALID [2022-04-15 00:50:01,278 INFO L290 TraceCheckUtils]: 78: Hoare triple {3565#(= main_~y~0 24)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3565#(= main_~y~0 24)} is VALID [2022-04-15 00:50:01,278 INFO L290 TraceCheckUtils]: 79: Hoare triple {3565#(= main_~y~0 24)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3575#(= main_~y~0 25)} is VALID [2022-04-15 00:50:01,278 INFO L290 TraceCheckUtils]: 80: Hoare triple {3575#(= main_~y~0 25)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3575#(= main_~y~0 25)} is VALID [2022-04-15 00:50:01,279 INFO L290 TraceCheckUtils]: 81: Hoare triple {3575#(= main_~y~0 25)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3575#(= main_~y~0 25)} is VALID [2022-04-15 00:50:01,279 INFO L290 TraceCheckUtils]: 82: Hoare triple {3575#(= main_~y~0 25)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3585#(= main_~y~0 26)} is VALID [2022-04-15 00:50:01,279 INFO L290 TraceCheckUtils]: 83: Hoare triple {3585#(= main_~y~0 26)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3585#(= main_~y~0 26)} is VALID [2022-04-15 00:50:01,279 INFO L290 TraceCheckUtils]: 84: Hoare triple {3585#(= main_~y~0 26)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3585#(= main_~y~0 26)} is VALID [2022-04-15 00:50:01,280 INFO L290 TraceCheckUtils]: 85: Hoare triple {3585#(= main_~y~0 26)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3575#(= main_~y~0 25)} is VALID [2022-04-15 00:50:01,280 INFO L290 TraceCheckUtils]: 86: Hoare triple {3575#(= main_~y~0 25)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3575#(= main_~y~0 25)} is VALID [2022-04-15 00:50:01,280 INFO L290 TraceCheckUtils]: 87: Hoare triple {3575#(= main_~y~0 25)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3575#(= main_~y~0 25)} is VALID [2022-04-15 00:50:01,280 INFO L290 TraceCheckUtils]: 88: Hoare triple {3575#(= main_~y~0 25)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3565#(= main_~y~0 24)} is VALID [2022-04-15 00:50:01,280 INFO L290 TraceCheckUtils]: 89: Hoare triple {3565#(= main_~y~0 24)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3565#(= main_~y~0 24)} is VALID [2022-04-15 00:50:01,281 INFO L290 TraceCheckUtils]: 90: Hoare triple {3565#(= main_~y~0 24)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3565#(= main_~y~0 24)} is VALID [2022-04-15 00:50:01,281 INFO L290 TraceCheckUtils]: 91: Hoare triple {3565#(= main_~y~0 24)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3555#(= 23 main_~y~0)} is VALID [2022-04-15 00:50:01,281 INFO L290 TraceCheckUtils]: 92: Hoare triple {3555#(= 23 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3555#(= 23 main_~y~0)} is VALID [2022-04-15 00:50:01,281 INFO L290 TraceCheckUtils]: 93: Hoare triple {3555#(= 23 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3555#(= 23 main_~y~0)} is VALID [2022-04-15 00:50:01,281 INFO L290 TraceCheckUtils]: 94: Hoare triple {3555#(= 23 main_~y~0)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3545#(= main_~y~0 22)} is VALID [2022-04-15 00:50:01,282 INFO L290 TraceCheckUtils]: 95: Hoare triple {3545#(= main_~y~0 22)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3545#(= main_~y~0 22)} is VALID [2022-04-15 00:50:01,282 INFO L290 TraceCheckUtils]: 96: Hoare triple {3545#(= main_~y~0 22)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3545#(= main_~y~0 22)} is VALID [2022-04-15 00:50:01,282 INFO L290 TraceCheckUtils]: 97: Hoare triple {3545#(= main_~y~0 22)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3535#(= main_~y~0 21)} is VALID [2022-04-15 00:50:01,291 INFO L290 TraceCheckUtils]: 98: Hoare triple {3535#(= main_~y~0 21)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3535#(= main_~y~0 21)} is VALID [2022-04-15 00:50:01,291 INFO L290 TraceCheckUtils]: 99: Hoare triple {3535#(= main_~y~0 21)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3535#(= main_~y~0 21)} is VALID [2022-04-15 00:50:01,292 INFO L290 TraceCheckUtils]: 100: Hoare triple {3535#(= main_~y~0 21)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,292 INFO L290 TraceCheckUtils]: 101: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,292 INFO L290 TraceCheckUtils]: 102: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-15 00:50:01,292 INFO L290 TraceCheckUtils]: 103: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3515#(= 19 main_~y~0)} is VALID [2022-04-15 00:50:01,293 INFO L290 TraceCheckUtils]: 104: Hoare triple {3515#(= 19 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3515#(= 19 main_~y~0)} is VALID [2022-04-15 00:50:01,293 INFO L290 TraceCheckUtils]: 105: Hoare triple {3515#(= 19 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3515#(= 19 main_~y~0)} is VALID [2022-04-15 00:50:01,293 INFO L290 TraceCheckUtils]: 106: Hoare triple {3515#(= 19 main_~y~0)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3505#(= main_~y~0 18)} is VALID [2022-04-15 00:50:01,293 INFO L290 TraceCheckUtils]: 107: Hoare triple {3505#(= main_~y~0 18)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3505#(= main_~y~0 18)} is VALID [2022-04-15 00:50:01,293 INFO L290 TraceCheckUtils]: 108: Hoare triple {3505#(= main_~y~0 18)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3505#(= main_~y~0 18)} is VALID [2022-04-15 00:50:01,294 INFO L290 TraceCheckUtils]: 109: Hoare triple {3505#(= main_~y~0 18)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-15 00:50:01,294 INFO L290 TraceCheckUtils]: 110: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-15 00:50:01,294 INFO L290 TraceCheckUtils]: 111: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-15 00:50:01,295 INFO L272 TraceCheckUtils]: 112: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {3676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:50:01,295 INFO L290 TraceCheckUtils]: 113: Hoare triple {3676#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __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] {3680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:50:01,295 INFO L290 TraceCheckUtils]: 114: Hoare triple {3680#(<= 1 __VERIFIER_assert_~cond)} [61] 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[] {3277#false} is VALID [2022-04-15 00:50:01,295 INFO L290 TraceCheckUtils]: 115: Hoare triple {3277#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:50:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 00:50:01,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:50:02,993 INFO L290 TraceCheckUtils]: 115: Hoare triple {3277#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3277#false} is VALID [2022-04-15 00:50:02,993 INFO L290 TraceCheckUtils]: 114: Hoare triple {3680#(<= 1 __VERIFIER_assert_~cond)} [61] 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[] {3277#false} is VALID [2022-04-15 00:50:02,994 INFO L290 TraceCheckUtils]: 113: Hoare triple {3676#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __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] {3680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:50:02,994 INFO L272 TraceCheckUtils]: 112: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {3676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:50:02,994 INFO L290 TraceCheckUtils]: 111: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:50:02,994 INFO L290 TraceCheckUtils]: 110: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:50:02,995 INFO L290 TraceCheckUtils]: 109: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:50:02,995 INFO L290 TraceCheckUtils]: 108: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:50:02,995 INFO L290 TraceCheckUtils]: 107: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:50:02,996 INFO L290 TraceCheckUtils]: 106: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:50:02,996 INFO L290 TraceCheckUtils]: 105: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 00:50:02,996 INFO L290 TraceCheckUtils]: 104: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 00:50:02,997 INFO L290 TraceCheckUtils]: 103: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 00:50:02,997 INFO L290 TraceCheckUtils]: 102: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 00:50:02,997 INFO L290 TraceCheckUtils]: 101: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 00:50:02,998 INFO L290 TraceCheckUtils]: 100: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 00:50:02,998 INFO L290 TraceCheckUtils]: 99: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:02,998 INFO L290 TraceCheckUtils]: 98: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:02,999 INFO L290 TraceCheckUtils]: 97: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:02,999 INFO L290 TraceCheckUtils]: 96: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:02,999 INFO L290 TraceCheckUtils]: 95: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,000 INFO L290 TraceCheckUtils]: 94: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,000 INFO L290 TraceCheckUtils]: 93: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,000 INFO L290 TraceCheckUtils]: 92: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,000 INFO L290 TraceCheckUtils]: 91: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,001 INFO L290 TraceCheckUtils]: 90: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-15 00:50:03,001 INFO L290 TraceCheckUtils]: 89: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-15 00:50:03,001 INFO L290 TraceCheckUtils]: 88: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-15 00:50:03,002 INFO L290 TraceCheckUtils]: 87: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,002 INFO L290 TraceCheckUtils]: 86: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,002 INFO L290 TraceCheckUtils]: 85: Hoare triple {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,003 INFO L290 TraceCheckUtils]: 84: Hoare triple {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} is VALID [2022-04-15 00:50:03,003 INFO L290 TraceCheckUtils]: 83: Hoare triple {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} is VALID [2022-04-15 00:50:03,003 INFO L290 TraceCheckUtils]: 82: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} is VALID [2022-04-15 00:50:03,004 INFO L290 TraceCheckUtils]: 81: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,004 INFO L290 TraceCheckUtils]: 80: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,004 INFO L290 TraceCheckUtils]: 79: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,004 INFO L290 TraceCheckUtils]: 78: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-15 00:50:03,005 INFO L290 TraceCheckUtils]: 77: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-15 00:50:03,005 INFO L290 TraceCheckUtils]: 76: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-15 00:50:03,005 INFO L290 TraceCheckUtils]: 75: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,006 INFO L290 TraceCheckUtils]: 74: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,006 INFO L290 TraceCheckUtils]: 73: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,006 INFO L290 TraceCheckUtils]: 72: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,008 INFO L290 TraceCheckUtils]: 67: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 00:50:03,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 00:50:03,009 INFO L290 TraceCheckUtils]: 64: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 00:50:03,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 00:50:03,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 00:50:03,010 INFO L290 TraceCheckUtils]: 61: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-15 00:50:03,010 INFO L290 TraceCheckUtils]: 60: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:50:03,010 INFO L290 TraceCheckUtils]: 59: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:50:03,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 00:50:03,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:50:03,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:50:03,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 00:50:03,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-15 00:50:03,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-15 00:50:03,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-15 00:50:03,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} is VALID [2022-04-15 00:50:03,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} is VALID [2022-04-15 00:50:03,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} is VALID [2022-04-15 00:50:03,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-15 00:50:03,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-15 00:50:03,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-15 00:50:03,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} is VALID [2022-04-15 00:50:03,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} is VALID [2022-04-15 00:50:03,015 INFO L290 TraceCheckUtils]: 43: Hoare triple {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} is VALID [2022-04-15 00:50:03,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,016 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,016 INFO L290 TraceCheckUtils]: 40: Hoare triple {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} is VALID [2022-04-15 00:50:03,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} is VALID [2022-04-15 00:50:03,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} is VALID [2022-04-15 00:50:03,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} is VALID [2022-04-15 00:50:03,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} is VALID [2022-04-15 00:50:03,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} is VALID [2022-04-15 00:50:03,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {3957#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} is VALID [2022-04-15 00:50:03,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {3957#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3957#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} is VALID [2022-04-15 00:50:03,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {3964#(or (not (= (mod (+ main_~y~0 9) 4294967296) 0)) (not (< (mod (+ main_~x~0 1) 4294967296) 500000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3957#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} is VALID [2022-04-15 00:50:03,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3964#(or (not (= (mod (+ main_~y~0 9) 4294967296) 0)) (not (< (mod (+ main_~x~0 1) 4294967296) 500000)))} is VALID [2022-04-15 00:50:03,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} is VALID [2022-04-15 00:50:03,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} is VALID [2022-04-15 00:50:03,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} is VALID [2022-04-15 00:50:03,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} is VALID [2022-04-15 00:50:03,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} is VALID [2022-04-15 00:50:03,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} is VALID [2022-04-15 00:50:03,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} is VALID [2022-04-15 00:50:03,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} is VALID [2022-04-15 00:50:03,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} is VALID [2022-04-15 00:50:03,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} is VALID [2022-04-15 00:50:03,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} is VALID [2022-04-15 00:50:03,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} is VALID [2022-04-15 00:50:03,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} is VALID [2022-04-15 00:50:03,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} is VALID [2022-04-15 00:50:03,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} is VALID [2022-04-15 00:50:03,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} is VALID [2022-04-15 00:50:03,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} is VALID [2022-04-15 00:50:03,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} is VALID [2022-04-15 00:50:03,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-15 00:50:03,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-15 00:50:03,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {4038#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-15 00:50:03,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {4038#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4038#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} is VALID [2022-04-15 00:50:03,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {3276#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4038#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} is VALID [2022-04-15 00:50:03,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {3276#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:50:03,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3276#true} {3276#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:50:03,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {3276#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:50:03,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {3276#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3276#true} is VALID [2022-04-15 00:50:03,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {3276#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3276#true} is VALID [2022-04-15 00:50:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 00:50:03,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412699529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:50:03,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:50:03,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 32] total 88 [2022-04-15 00:50:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135739723] [2022-04-15 00:50:03,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:50:03,030 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 00:50:03,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:50:03,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:03,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:50:03,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-04-15 00:50:03,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:50:03,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-04-15 00:50:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=6684, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 00:50:03,163 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:53:49,722 WARN L232 SmtUtils]: Spent 1.96m on a formula simplification. DAG size of input: 160 DAG size of output: 150 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 00:53:54,476 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= 0 (mod (+ 17 c_main_~y~0) 4294967296))) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-15 00:53:56,510 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= 0 (mod (+ 17 c_main_~y~0) 4294967296))) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-04-15 00:55:39,457 WARN L232 SmtUtils]: Spent 47.74s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 00:57:52,163 WARN L232 SmtUtils]: Spent 54.78s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 00:57:57,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:57:59,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:00:09,929 WARN L232 SmtUtils]: Spent 1.07m on a formula simplification that was a NOOP. DAG size: 149 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:00:13,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:02:28,834 WARN L232 SmtUtils]: Spent 1.03m on a formula simplification that was a NOOP. DAG size: 144 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:02:32,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:02:34,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:02:37,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:02:42,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:02:45,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:02:52,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:00,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:04,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:11,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:14,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:17,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:24,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:26,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:30,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:33,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:37,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 01:03:39,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []