/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 19:34:07,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 19:34:07,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 19:34:07,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 19:34:07,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 19:34:07,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 19:34:07,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 19:34:07,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 19:34:07,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 19:34:07,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 19:34:07,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 19:34:07,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 19:34:07,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 19:34:07,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 19:34:07,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 19:34:07,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 19:34:07,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 19:34:07,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 19:34:07,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 19:34:07,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 19:34:07,894 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 19:34:07,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 19:34:07,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 19:34:07,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 19:34:07,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 19:34:07,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 19:34:07,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 19:34:07,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 19:34:07,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 19:34:07,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 19:34:07,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 19:34:07,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 19:34:07,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 19:34:07,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 19:34:07,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 19:34:07,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 19:34:07,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 19:34:07,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 19:34:07,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 19:34:07,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 19:34:07,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 19:34:07,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 19:34:07,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 19:34:07,928 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 19:34:07,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 19:34:07,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 19:34:07,929 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 19:34:07,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 19:34:07,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 19:34:07,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 19:34:07,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 19:34:07,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 19:34:07,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 19:34:07,930 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 19:34:07,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 19:34:07,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 19:34:07,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 19:34:07,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 19:34:07,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 19:34:07,931 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 19:34:07,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 19:34:07,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:34:07,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 19:34:07,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 19:34:07,932 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 19:34:07,932 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 19:34:08,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 19:34:08,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 19:34:08,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 19:34:08,172 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 19:34:08,173 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 19:34:08,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-14 19:34:08,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0899d14b0/8e7a85fe4c5c4b6986ea4a73bf72de5b/FLAGe428a8965 [2022-04-14 19:34:08,584 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 19:34:08,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-14 19:34:08,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0899d14b0/8e7a85fe4c5c4b6986ea4a73bf72de5b/FLAGe428a8965 [2022-04-14 19:34:08,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0899d14b0/8e7a85fe4c5c4b6986ea4a73bf72de5b [2022-04-14 19:34:08,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 19:34:08,603 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 19:34:08,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 19:34:08,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 19:34:08,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 19:34:08,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa6511d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08, skipping insertion in model container [2022-04-14 19:34:08,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 19:34:08,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 19:34:08,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-04-14 19:34:08,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:34:08,806 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 19:34:08,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-04-14 19:34:08,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:34:08,829 INFO L208 MainTranslator]: Completed translation [2022-04-14 19:34:08,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08 WrapperNode [2022-04-14 19:34:08,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 19:34:08,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 19:34:08,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 19:34:08,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 19:34:08,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 19:34:08,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 19:34:08,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 19:34:08,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 19:34:08,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08" (1/1) ... [2022-04-14 19:34:08,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:34:08,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:34:08,877 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-14 19:34:08,896 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-14 19:34:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 19:34:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 19:34:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 19:34:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 19:34:08,907 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 19:34:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 19:34:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 19:34:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 19:34:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 19:34:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 19:34:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 19:34:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 19:34:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 19:34:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 19:34:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 19:34:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 19:34:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 19:34:08,953 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 19:34:08,954 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 19:34:09,090 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 19:34:09,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 19:34:09,095 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 19:34:09,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:34:09 BoogieIcfgContainer [2022-04-14 19:34:09,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 19:34:09,096 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 19:34:09,096 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 19:34:09,106 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 19:34:09,108 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:34:09" (1/1) ... [2022-04-14 19:34:09,109 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 19:34:09,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:34:09 BasicIcfg [2022-04-14 19:34:09,138 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 19:34:09,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 19:34:09,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 19:34:09,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 19:34:09,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:34:08" (1/4) ... [2022-04-14 19:34:09,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bea8d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:34:09, skipping insertion in model container [2022-04-14 19:34:09,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:34:08" (2/4) ... [2022-04-14 19:34:09,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bea8d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:34:09, skipping insertion in model container [2022-04-14 19:34:09,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:34:09" (3/4) ... [2022-04-14 19:34:09,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bea8d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:34:09, skipping insertion in model container [2022-04-14 19:34:09,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:34:09" (4/4) ... [2022-04-14 19:34:09,147 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono6_1.cJordan [2022-04-14 19:34:09,150 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 19:34:09,150 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 19:34:09,182 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 19:34:09,187 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 19:34:09,188 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 19:34:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 19:34:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 19:34:09,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:34:09,204 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:34:09,204 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:34:09,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:34:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-04-14 19:34:09,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:34:09,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346790849] [2022-04-14 19:34:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:34:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:34:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:09,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:34:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:09,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-14 19:34:09,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 19:34:09,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 19:34:09,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:34:09,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-14 19:34:09,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 19:34:09,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 19:34:09,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-14 19:34:09,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {24#true} is VALID [2022-04-14 19:34:09,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [53] L10-2-->L10-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-14 19:34:09,372 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {25#false} is VALID [2022-04-14 19:34:09,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-14 19:34:09,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-14 19:34:09,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-14 19:34:09,374 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-14 19:34:09,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:34:09,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346790849] [2022-04-14 19:34:09,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346790849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:34:09,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:34:09,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 19:34:09,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682970846] [2022-04-14 19:34:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:34:09,380 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-14 19:34:09,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:34:09,383 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-14 19:34:09,397 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-14 19:34:09,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 19:34:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:34:09,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 19:34:09,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 19:34:09,417 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:09,476 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-14 19:34:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 19:34:09,476 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-14 19:34:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:34:09,477 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-14 19:34:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-14 19:34:09,485 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-14 19:34:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-14 19:34:09,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-04-14 19:34:09,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:34:09,540 INFO L225 Difference]: With dead ends: 21 [2022-04-14 19:34:09,540 INFO L226 Difference]: Without dead ends: 14 [2022-04-14 19:34:09,541 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-14 19:34:09,543 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:34:09,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:34:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-14 19:34:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-14 19:34:09,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:34:09,564 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-14 19:34:09,565 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-14 19:34:09,566 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-14 19:34:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:09,571 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-14 19:34:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-14 19:34:09,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:09,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:09,573 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-14 19:34:09,574 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-14 19:34:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:09,577 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-14 19:34:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-14 19:34:09,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:09,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:09,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:34:09,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:34:09,578 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-14 19:34:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-14 19:34:09,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-14 19:34:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:34:09,580 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-14 19:34:09,581 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-14 19:34:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-14 19:34:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 19:34:09,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:34:09,582 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:34:09,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 19:34:09,583 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:34:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:34:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-04-14 19:34:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:34:09,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944225656] [2022-04-14 19:34:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:34:09,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:34:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:09,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:34:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:09,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-14 19:34:09,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 19:34:09,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 19:34:09,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {95#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:34:09,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-14 19:34:09,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 19:34:09,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 19:34:09,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {95#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-14 19:34:09,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {100#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-14 19:34:09,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-14 19:34:09,728 INFO L272 TraceCheckUtils]: 7: Hoare triple {96#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {96#false} is VALID [2022-04-14 19:34:09,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {96#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {96#false} is VALID [2022-04-14 19:34:09,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-14 19:34:09,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-14 19:34:09,729 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-14 19:34:09,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:34:09,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944225656] [2022-04-14 19:34:09,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944225656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:34:09,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:34:09,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 19:34:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634092366] [2022-04-14 19:34:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:34:09,731 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-14 19:34:09,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:34:09,732 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-14 19:34:09,742 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-14 19:34:09,742 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 19:34:09,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:34:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 19:34:09,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 19:34:09,744 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-14 19:34:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:09,802 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-14 19:34:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 19:34:09,802 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-14 19:34:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:34:09,803 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-14 19:34:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-14 19:34:09,804 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-14 19:34:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-14 19:34:09,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-14 19:34:09,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:34:09,821 INFO L225 Difference]: With dead ends: 17 [2022-04-14 19:34:09,821 INFO L226 Difference]: Without dead ends: 17 [2022-04-14 19:34:09,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:34:09,822 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-14 19:34:09,822 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-14 19:34:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-14 19:34:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-14 19:34:09,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:34:09,833 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-14 19:34:09,833 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-14 19:34:09,833 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-14 19:34:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:09,834 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-14 19:34:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-14 19:34:09,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:09,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:09,835 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-14 19:34:09,835 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-14 19:34:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:09,836 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-14 19:34:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-14 19:34:09,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:09,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:09,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:34:09,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:34:09,837 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-14 19:34:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-14 19:34:09,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-14 19:34:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:34:09,838 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-14 19:34:09,838 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-14 19:34:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-14 19:34:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 19:34:09,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:34:09,838 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:34:09,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 19:34:09,839 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:34:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:34:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1516694440, now seen corresponding path program 1 times [2022-04-14 19:34:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:34:09,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209170363] [2022-04-14 19:34:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:34:09,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:34:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:34:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:10,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-14 19:34:10,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:34:10,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-14 19:34:10,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-14 19:34:10,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-14 19:34:10,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-14 19:34:10,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {179#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-14 19:34:10,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-14 19:34:10,047 INFO L272 TraceCheckUtils]: 10: Hoare triple {174#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {174#false} is VALID [2022-04-14 19:34:10,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {174#false} is VALID [2022-04-14 19:34:10,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {174#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-14 19:34:10,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-14 19:34:10,048 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-14 19:34:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:34:10,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209170363] [2022-04-14 19:34:10,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209170363] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:34:10,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646442747] [2022-04-14 19:34:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:34:10,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:34:10,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:34:10,050 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-14 19:34:10,051 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-14 19:34:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:10,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 19:34:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:10,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:34:10,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-14 19:34:10,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:10,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:10,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:10,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {209#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:10,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {209#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:10,233 INFO L272 TraceCheckUtils]: 10: Hoare triple {209#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {216#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:34:10,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {220#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:34:10,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-14 19:34:10,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-14 19:34:10,235 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-14 19:34:10,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:34:10,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-14 19:34:10,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-14 19:34:10,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {220#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:34:10,358 INFO L272 TraceCheckUtils]: 10: Hoare triple {236#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {216#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:34:10,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {236#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:34:10,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {236#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:34:10,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:10,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:10,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {243#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:10,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-14 19:34:10,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 19:34:10,362 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-14 19:34:10,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646442747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:34:10,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:34:10,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-14 19:34:10,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285877678] [2022-04-14 19:34:10,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:34:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 19:34:10,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:34:10,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:10,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:34:10,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 19:34:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:34:10,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 19:34:10,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-14 19:34:10,392 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:10,720 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-14 19:34:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 19:34:10,721 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 19:34:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:34:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2022-04-14 19:34:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2022-04-14 19:34:10,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 38 transitions. [2022-04-14 19:34:10,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:34:10,772 INFO L225 Difference]: With dead ends: 31 [2022-04-14 19:34:10,772 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 19:34:10,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-04-14 19:34:10,773 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:34:10,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 36 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:34:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 19:34:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-14 19:34:10,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:34:10,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:10,776 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:10,776 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:10,778 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-14 19:34:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-14 19:34:10,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:10,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:10,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-14 19:34:10,778 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-14 19:34:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:10,779 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-14 19:34:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-14 19:34:10,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:10,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:10,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:34:10,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:34:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-14 19:34:10,781 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-14 19:34:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:34:10,781 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-14 19:34:10,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-14 19:34:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 19:34:10,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:34:10,782 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:34:10,801 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-14 19:34:11,001 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-14 19:34:11,001 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:34:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:34:11,002 INFO L85 PathProgramCache]: Analyzing trace with hash -691789689, now seen corresponding path program 1 times [2022-04-14 19:34:11,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:34:11,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937684038] [2022-04-14 19:34:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:34:11,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:34:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:34:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:11,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {394#true} is VALID [2022-04-14 19:34:11,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {394#true} {394#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:34:11,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {394#true} is VALID [2022-04-14 19:34:11,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394#true} {394#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {394#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {399#(= main_~x~0 0)} is VALID [2022-04-14 19:34:11,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {399#(= main_~x~0 0)} is VALID [2022-04-14 19:34:11,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {399#(= main_~x~0 0)} is VALID [2022-04-14 19:34:11,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:34:11,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:34:11,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:34:11,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {401#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-14 19:34:11,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {401#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {401#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-14 19:34:11,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {401#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {395#false} is VALID [2022-04-14 19:34:11,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-14 19:34:11,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {395#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-14 19:34:11,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,116 INFO L272 TraceCheckUtils]: 19: Hoare triple {395#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {395#false} is VALID [2022-04-14 19:34:11,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {395#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {395#false} is VALID [2022-04-14 19:34:11,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {395#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {395#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 19:34:11,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:34:11,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937684038] [2022-04-14 19:34:11,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937684038] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:34:11,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211090123] [2022-04-14 19:34:11,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:34:11,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:34:11,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:34:11,118 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-14 19:34:11,123 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-14 19:34:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:11,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-14 19:34:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:11,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:34:11,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {394#true} is VALID [2022-04-14 19:34:11,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394#true} {394#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {394#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {399#(= main_~x~0 0)} is VALID [2022-04-14 19:34:11,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {399#(= main_~x~0 0)} is VALID [2022-04-14 19:34:11,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {399#(= main_~x~0 0)} is VALID [2022-04-14 19:34:11,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:34:11,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:34:11,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:34:11,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {400#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {439#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:34:11,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {439#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {439#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:34:11,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {439#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {395#false} is VALID [2022-04-14 19:34:11,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-14 19:34:11,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {395#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-14 19:34:11,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,415 INFO L272 TraceCheckUtils]: 19: Hoare triple {395#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {395#false} is VALID [2022-04-14 19:34:11,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {395#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {395#false} is VALID [2022-04-14 19:34:11,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {395#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {395#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 19:34:11,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:34:11,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {395#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {395#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {395#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {395#false} is VALID [2022-04-14 19:34:11,613 INFO L272 TraceCheckUtils]: 19: Hoare triple {395#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {395#false} is VALID [2022-04-14 19:34:11,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {395#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-14 19:34:11,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {395#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {395#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-14 19:34:11,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {395#false} is VALID [2022-04-14 19:34:11,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {500#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {395#false} is VALID [2022-04-14 19:34:11,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {504#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {500#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:34:11,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {504#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-14 19:34:11,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:11,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:11,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {508#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:11,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-14 19:34:11,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-14 19:34:11,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {518#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-14 19:34:11,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {394#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394#true} {394#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {394#true} is VALID [2022-04-14 19:34:11,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-14 19:34:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 19:34:11,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211090123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:34:11,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:34:11,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-14 19:34:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613647943] [2022-04-14 19:34:11,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:34:11,623 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 19:34:11,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:34:11,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:11,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:34:11,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 19:34:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:34:11,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 19:34:11,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-14 19:34:11,659 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:11,909 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-14 19:34:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 19:34:11,910 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 19:34:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:34:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-14 19:34:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-14 19:34:11,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-14 19:34:11,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:34:11,951 INFO L225 Difference]: With dead ends: 34 [2022-04-14 19:34:11,951 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 19:34:11,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-04-14 19:34:11,952 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:34:11,952 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 28 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 19:34:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 19:34:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-14 19:34:11,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:34:11,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:11,955 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:11,955 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:11,956 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-14 19:34:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-14 19:34:11,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:11,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:11,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-14 19:34:11,957 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-14 19:34:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:11,958 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-14 19:34:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-14 19:34:11,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:11,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:11,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:34:11,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:34:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-14 19:34:11,960 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-04-14 19:34:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:34:11,960 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-14 19:34:11,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 19:34:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 19:34:11,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:34:11,961 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:34:11,985 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-14 19:34:12,171 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-14 19:34:12,172 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:34:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:34:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash -888303194, now seen corresponding path program 2 times [2022-04-14 19:34:12,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:34:12,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020625018] [2022-04-14 19:34:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:34:12,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:34:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:12,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:34:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:12,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {690#true} is VALID [2022-04-14 19:34:12,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {690#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-14 19:34:12,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {690#true} {690#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-14 19:34:12,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {690#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:34:12,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {690#true} is VALID [2022-04-14 19:34:12,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {690#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-14 19:34:12,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {690#true} {690#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-14 19:34:12,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {690#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-14 19:34:12,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {690#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-14 19:34:12,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-14 19:34:12,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-14 19:34:12,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {695#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-14 19:34:12,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-14 19:34:12,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-14 19:34:12,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {696#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-14 19:34:12,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-14 19:34:12,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-14 19:34:12,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {697#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {698#(and (or (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= main_~y~0 (+ main_~x~0 9999997))) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-14 19:34:12,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#(and (or (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= main_~y~0 (+ main_~x~0 9999997))) (<= (+ main_~x~0 9999997) main_~y~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {699#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-14 19:34:12,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {699#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {699#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-14 19:34:12,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {699#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {700#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} is VALID [2022-04-14 19:34:12,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {700#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-14 19:34:12,317 INFO L272 TraceCheckUtils]: 19: Hoare triple {691#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {691#false} is VALID [2022-04-14 19:34:12,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {691#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {691#false} is VALID [2022-04-14 19:34:12,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {691#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-14 19:34:12,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {691#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-14 19:34:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:34:12,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:34:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020625018] [2022-04-14 19:34:12,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020625018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:34:12,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102659421] [2022-04-14 19:34:12,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 19:34:12,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:34:12,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:34:12,319 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-14 19:34:12,320 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-14 19:34:12,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-14 19:34:12,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 19:34:12,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-14 19:34:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:12,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:34:12,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {690#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-14 19:34:12,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {690#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {690#true} is VALID [2022-04-14 19:34:12,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {690#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-14 19:34:12,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {690#true} {690#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-14 19:34:12,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {690#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#true} is VALID [2022-04-14 19:34:12,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {690#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {720#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {760#(and (not (< (mod main_~x~0 4294967296) 10000000)) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:12,630 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#(and (not (< (mod main_~x~0 4294967296) 10000000)) (= 5000000 main_~z~0))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:34:12,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {764#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:34:12,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {768#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-14 19:34:12,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {691#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {691#false} is VALID [2022-04-14 19:34:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-14 19:34:12,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 19:34:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102659421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:34:12,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 19:34:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-04-14 19:34:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862463928] [2022-04-14 19:34:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:34:12,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 19:34:12,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:34:12,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:12,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:34:12,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:34:12,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:34:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:34:12,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-04-14 19:34:12,640 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:12,711 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-14 19:34:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:34:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-14 19:34:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:34:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-14 19:34:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-14 19:34:12,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-14 19:34:12,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:34:12,727 INFO L225 Difference]: With dead ends: 37 [2022-04-14 19:34:12,727 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 19:34:12,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-14 19:34:12,728 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:34:12,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:34:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 19:34:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-14 19:34:12,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:34:12,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:12,735 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:12,735 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:12,737 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-14 19:34:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-14 19:34:12,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:12,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:12,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-14 19:34:12,738 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-14 19:34:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:12,741 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-14 19:34:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-14 19:34:12,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:34:12,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:34:12,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:34:12,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:34:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-14 19:34:12,743 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2022-04-14 19:34:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:34:12,744 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-14 19:34:12,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-14 19:34:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 19:34:12,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:34:12,747 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:34:12,767 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-14 19:34:12,960 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-14 19:34:12,961 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:34:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:34:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1647316777, now seen corresponding path program 2 times [2022-04-14 19:34:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:34:12,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164233042] [2022-04-14 19:34:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:34:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:34:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:34:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:13,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {917#true} is VALID [2022-04-14 19:34:13,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {917#true} {917#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:34:13,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {917#true} is VALID [2022-04-14 19:34:13,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {922#(= main_~x~0 0)} is VALID [2022-04-14 19:34:13,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {922#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {922#(= main_~x~0 0)} is VALID [2022-04-14 19:34:13,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {922#(= main_~x~0 0)} is VALID [2022-04-14 19:34:13,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:34:13,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:34:13,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:34:13,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {923#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:34:13,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:34:13,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:34:13,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {924#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:34:13,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:34:13,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:34:13,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {925#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:34:13,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:34:13,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:34:13,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:34:13,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:34:13,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:34:13,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {927#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {928#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-14 19:34:13,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {928#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {928#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-14 19:34:13,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {928#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {918#false} is VALID [2022-04-14 19:34:13,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {918#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {918#false} is VALID [2022-04-14 19:34:13,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {918#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-14 19:34:13,114 INFO L272 TraceCheckUtils]: 28: Hoare triple {918#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {918#false} is VALID [2022-04-14 19:34:13,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {918#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {918#false} is VALID [2022-04-14 19:34:13,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {918#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-14 19:34:13,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-14 19:34:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:34:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:34:13,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164233042] [2022-04-14 19:34:13,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164233042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:34:13,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284767924] [2022-04-14 19:34:13,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 19:34:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:34:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:34:13,117 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-14 19:34:13,118 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-14 19:34:13,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 19:34:13,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 19:34:13,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 19:34:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:34:13,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:34:13,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {917#true} is VALID [2022-04-14 19:34:13,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {958#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-14 19:34:13,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-14 19:34:13,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-14 19:34:13,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-14 19:34:13,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-14 19:34:13,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-14 19:34:13,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-14 19:34:13,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-14 19:34:13,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-14 19:34:13,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {988#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {998#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1008#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {1008#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1008#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:34:13,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {1008#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1015#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-14 19:34:13,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {1015#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1019#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-14 19:34:13,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1019#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-14 19:34:13,446 INFO L272 TraceCheckUtils]: 28: Hoare triple {1019#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:34:13,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:34:13,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {1030#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-14 19:34:13,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-14 19:34:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:34:13,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:34:13,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-14 19:34:13,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {1030#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-14 19:34:13,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:34:13,723 INFO L272 TraceCheckUtils]: 28: Hoare triple {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:34:13,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:34:13,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:34:13,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:13,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:34:13,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1046#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:34:13,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:13,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:13,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1053#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:34:13,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:34:13,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:34:13,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1072#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:34:13,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:34:13,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:34:13,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1082#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:34:13,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:34:13,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:34:13,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1092#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:34:13,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:34:13,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:34:13,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1102#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:34:13,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:34:13,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:34:13,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1112#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:34:13,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {917#true} is VALID [2022-04-14 19:34:13,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-14 19:34:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 19:34:13,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284767924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:34:13,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:34:13,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 28 [2022-04-14 19:34:13,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342989002] [2022-04-14 19:34:13,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:34:13,742 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-14 19:34:13,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:34:13,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:13,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:34:13,813 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-14 19:34:13,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:34:13,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-14 19:34:13,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2022-04-14 19:34:13,814 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:20,865 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-14 19:34:25,115 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-14 19:34:28,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:34:33,449 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-14 19:34:48,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:34:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:34:48,921 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2022-04-14 19:34:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-14 19:34:48,921 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-14 19:34:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:34:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 156 transitions. [2022-04-14 19:34:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:34:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 156 transitions. [2022-04-14 19:34:48,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 156 transitions. [2022-04-14 19:35:01,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 151 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-14 19:35:01,560 INFO L225 Difference]: With dead ends: 136 [2022-04-14 19:35:01,560 INFO L226 Difference]: Without dead ends: 125 [2022-04-14 19:35:01,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=713, Invalid=3193, Unknown=0, NotChecked=0, Total=3906 [2022-04-14 19:35:01,562 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 103 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 86 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-04-14 19:35:01,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 94 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 608 Invalid, 3 Unknown, 0 Unchecked, 15.5s Time] [2022-04-14 19:35:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-14 19:35:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2022-04-14 19:35:01,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:35:01,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 109 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 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-14 19:35:01,568 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 109 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 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-14 19:35:01,568 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 109 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 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-14 19:35:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:35:01,571 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2022-04-14 19:35:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2022-04-14 19:35:01,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:35:01,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:35:01,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 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 125 states. [2022-04-14 19:35:01,572 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 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 125 states. [2022-04-14 19:35:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:35:01,575 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2022-04-14 19:35:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2022-04-14 19:35:01,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:35:01,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:35:01,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:35:01,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:35:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 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-14 19:35:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2022-04-14 19:35:01,578 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 32 [2022-04-14 19:35:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:35:01,578 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2022-04-14 19:35:01,578 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:35:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2022-04-14 19:35:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-14 19:35:01,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:35:01,579 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:35:01,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-14 19:35:01,791 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-14 19:35:01,791 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:35:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:35:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash -784123847, now seen corresponding path program 3 times [2022-04-14 19:35:01,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:35:01,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497225755] [2022-04-14 19:35:01,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:35:01,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:35:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:35:01,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:35:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:35:01,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {1717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1704#true} is VALID [2022-04-14 19:35:01,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1704#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1704#true} is VALID [2022-04-14 19:35:01,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1704#true} {1704#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1704#true} is VALID [2022-04-14 19:35:01,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {1704#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:35:01,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {1717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1704#true} is VALID [2022-04-14 19:35:01,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {1704#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1704#true} is VALID [2022-04-14 19:35:01,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1704#true} {1704#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1704#true} is VALID [2022-04-14 19:35:01,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {1704#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1704#true} is VALID [2022-04-14 19:35:01,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {1704#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1709#(= main_~x~0 0)} is VALID [2022-04-14 19:35:01,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {1709#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1709#(= main_~x~0 0)} is VALID [2022-04-14 19:35:01,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {1709#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1709#(= main_~x~0 0)} is VALID [2022-04-14 19:35:01,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {1709#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1710#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:35:01,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {1710#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1710#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:35:01,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {1710#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1710#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:35:01,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {1710#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1711#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:35:01,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {1711#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1711#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:35:01,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {1711#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1711#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:35:01,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {1711#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1712#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:35:01,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {1712#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1712#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:35:01,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1712#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:35:01,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1713#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:35:01,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {1713#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1713#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:35:01,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {1713#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1713#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:35:01,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {1713#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1714#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:35:01,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {1714#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1714#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:35:01,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {1714#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1714#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:35:01,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {1714#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:35:01,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {1715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:35:01,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {1715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:35:01,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {1715#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1716#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-14 19:35:01,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {1716#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1716#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-14 19:35:01,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {1716#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1705#false} is VALID [2022-04-14 19:35:01,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {1705#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1705#false} is VALID [2022-04-14 19:35:01,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {1705#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1705#false} is VALID [2022-04-14 19:35:01,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {1705#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1705#false} is VALID [2022-04-14 19:35:01,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {1705#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1705#false} is VALID [2022-04-14 19:35:01,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {1705#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1705#false} is VALID [2022-04-14 19:35:01,966 INFO L272 TraceCheckUtils]: 34: Hoare triple {1705#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1705#false} is VALID [2022-04-14 19:35:01,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {1705#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1705#false} is VALID [2022-04-14 19:35:01,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {1705#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1705#false} is VALID [2022-04-14 19:35:01,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {1705#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1705#false} is VALID [2022-04-14 19:35:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 19:35:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:35:01,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497225755] [2022-04-14 19:35:01,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497225755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:35:01,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888472274] [2022-04-14 19:35:01,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 19:35:01,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:35:01,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:35:01,968 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-14 19:35:01,969 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-14 19:35:02,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-14 19:35:02,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 19:35:02,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 19:35:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:35:02,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:35:02,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {1704#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1704#true} is VALID [2022-04-14 19:35:02,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {1704#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1704#true} is VALID [2022-04-14 19:35:02,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {1704#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1704#true} is VALID [2022-04-14 19:35:02,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1704#true} {1704#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1704#true} is VALID [2022-04-14 19:35:02,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {1704#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1704#true} is VALID [2022-04-14 19:35:02,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {1704#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {1736#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {1736#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {1736#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {1736#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {1736#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {1736#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {1736#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {1736#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {1736#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {1736#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {1736#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {1736#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {1736#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {1736#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {1736#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {1736#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {1736#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {1736#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {1736#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {1736#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {1736#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {1736#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {1736#(= main_~y~0 10000000)} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {1736#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {1736#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1736#(= main_~y~0 10000000)} is VALID [2022-04-14 19:35:02,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {1736#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1815#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-14 19:35:02,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {1815#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1819#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-14 19:35:02,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {1819#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1705#false} is VALID [2022-04-14 19:35:02,420 INFO L272 TraceCheckUtils]: 34: Hoare triple {1705#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1705#false} is VALID [2022-04-14 19:35:02,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {1705#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1705#false} is VALID [2022-04-14 19:35:02,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {1705#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1705#false} is VALID [2022-04-14 19:35:02,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {1705#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1705#false} is VALID [2022-04-14 19:35:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-14 19:35:02,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 19:35:02,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888472274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:35:02,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 19:35:02,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-04-14 19:35:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198984653] [2022-04-14 19:35:02,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:35:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-14 19:35:02,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:35:02,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:35:02,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:35:02,433 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:35:02,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:35:02,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:35:02,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-14 19:35:02,434 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:35:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:35:02,500 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2022-04-14 19:35:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:35:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-14 19:35:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:35:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:35:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-14 19:35:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:35:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-14 19:35:02,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-14 19:35:02,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:35:02,530 INFO L225 Difference]: With dead ends: 158 [2022-04-14 19:35:02,530 INFO L226 Difference]: Without dead ends: 158 [2022-04-14 19:35:02,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-14 19:35:02,531 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:35:02,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:35:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-14 19:35:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2022-04-14 19:35:02,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:35:02,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 103 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 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-14 19:35:02,536 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 103 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 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-14 19:35:02,536 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 103 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 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-14 19:35:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:35:02,542 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2022-04-14 19:35:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 200 transitions. [2022-04-14 19:35:02,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:35:02,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:35:02,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 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 158 states. [2022-04-14 19:35:02,544 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 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 158 states. [2022-04-14 19:35:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:35:02,548 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2022-04-14 19:35:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 200 transitions. [2022-04-14 19:35:02,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:35:02,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:35:02,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:35:02,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:35:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 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-14 19:35:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2022-04-14 19:35:02,551 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 38 [2022-04-14 19:35:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:35:02,551 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2022-04-14 19:35:02,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:35:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2022-04-14 19:35:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-14 19:35:02,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:35:02,553 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:35:02,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 19:35:02,769 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-14 19:35:02,770 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:35:02,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:35:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1150947292, now seen corresponding path program 4 times [2022-04-14 19:35:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:35:02,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584769211] [2022-04-14 19:35:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:35:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:35:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:35:02,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:35:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:35:02,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {2426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2413#true} is VALID [2022-04-14 19:35:02,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {2413#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:02,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2413#true} {2413#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:02,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {2413#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:35:02,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {2426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2413#true} is VALID [2022-04-14 19:35:02,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {2413#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:02,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2413#true} {2413#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:02,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {2413#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:02,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {2413#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2418#(= main_~x~0 0)} is VALID [2022-04-14 19:35:02,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {2418#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2418#(= main_~x~0 0)} is VALID [2022-04-14 19:35:02,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {2418#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2418#(= main_~x~0 0)} is VALID [2022-04-14 19:35:02,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {2418#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:35:02,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {2419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:35:02,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {2419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:35:02,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {2419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:35:02,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {2420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:35:02,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {2420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:35:02,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:35:02,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {2421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:35:02,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {2421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:35:02,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {2421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2422#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:35:02,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {2422#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2422#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:35:02,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {2422#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2422#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:35:02,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {2422#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:35:02,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {2423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:35:02,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {2423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:35:02,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {2423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2424#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:35:02,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {2424#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2424#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:35:02,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {2424#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2424#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:35:02,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {2424#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2425#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-14 19:35:02,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {2425#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2425#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-14 19:35:02,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {2425#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2414#false} is VALID [2022-04-14 19:35:02,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {2414#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2414#false} is VALID [2022-04-14 19:35:02,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {2414#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:02,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {2414#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:02,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {2414#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2414#false} is VALID [2022-04-14 19:35:02,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {2414#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:02,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {2414#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2414#false} is VALID [2022-04-14 19:35:02,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {2414#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2414#false} is VALID [2022-04-14 19:35:02,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {2414#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:02,972 INFO L272 TraceCheckUtils]: 37: Hoare triple {2414#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {2414#false} is VALID [2022-04-14 19:35:02,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {2414#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2414#false} is VALID [2022-04-14 19:35:02,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {2414#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:02,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {2414#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-14 19:35:02,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:35:02,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584769211] [2022-04-14 19:35:02,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584769211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:35:02,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40264131] [2022-04-14 19:35:02,973 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 19:35:02,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:35:02,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:35:02,974 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-14 19:35:02,975 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-14 19:35:03,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 19:35:03,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 19:35:03,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 19:35:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:35:03,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:35:03,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {2413#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:03,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {2413#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2413#true} is VALID [2022-04-14 19:35:03,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {2413#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:03,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2413#true} {2413#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:03,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {2413#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:03,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {2413#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2445#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {2445#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2445#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2445#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2455#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {2455#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2455#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {2455#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2455#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {2455#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2465#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {2465#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2465#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {2465#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2465#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {2465#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2475#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2475#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2475#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {2475#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2485#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {2485#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2485#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {2485#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2485#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {2485#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2495#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-14 19:35:03,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {2495#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2495#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-14 19:35:03,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {2495#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2495#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-14 19:35:03,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {2495#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2505#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {2505#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2505#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {2505#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2505#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:35:03,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {2505#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2515#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-14 19:35:03,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {2515#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2515#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-14 19:35:03,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {2515#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2522#(and (= main_~z~0 5000001) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-14 19:35:03,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {2522#(and (= main_~z~0 5000001) (= 5 (+ (- 2) main_~x~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2526#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-14 19:35:03,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {2526#(and (= main_~z~0 5000001) (= main_~x~0 8))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2526#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-14 19:35:03,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {2526#(and (= main_~z~0 5000001) (= main_~x~0 8))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2526#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-14 19:35:03,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {2526#(and (= main_~z~0 5000001) (= main_~x~0 8))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2536#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} is VALID [2022-04-14 19:35:03,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {2536#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2536#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} is VALID [2022-04-14 19:35:03,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2543#(and (= (+ (- 1) main_~x~0) 8) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-14 19:35:03,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {2543#(and (= (+ (- 1) main_~x~0) 8) (= 5000001 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2547#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-14 19:35:03,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {2547#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2547#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-14 19:35:03,404 INFO L272 TraceCheckUtils]: 37: Hoare triple {2547#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {2554#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:35:03,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {2554#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2558#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:35:03,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {2558#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:03,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {2414#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:35:03,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:35:03,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {2414#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:03,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {2558#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2414#false} is VALID [2022-04-14 19:35:03,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {2554#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2558#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:35:03,844 INFO L272 TraceCheckUtils]: 37: Hoare triple {2574#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {2554#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:35:03,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {2574#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2574#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:35:03,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2574#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:35:03,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {2574#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:35:03,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {2574#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2574#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:35:03,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2574#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:35:03,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:35:03,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:35:03,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {2600#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:35:03,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2600#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:35:03,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:35:03,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {2600#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2581#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:35:03,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {2600#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2600#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:35:03,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {2600#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2600#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:35:03,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {2619#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2600#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:35:03,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {2619#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2619#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:35:03,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {2619#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2619#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:35:03,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2619#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:35:03,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2629#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:35:03,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2629#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:35:03,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {2639#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2629#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:35:03,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {2639#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2639#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:35:03,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {2639#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2639#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:35:03,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {2649#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2639#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:35:03,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {2649#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2649#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:35:03,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {2649#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2649#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:35:03,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {2659#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2649#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:35:03,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {2659#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2659#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:35:03,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2659#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:35:03,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {2669#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2659#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:35:03,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {2669#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2669#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-14 19:35:03,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {2669#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2669#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-14 19:35:03,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {2413#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2669#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-14 19:35:03,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {2413#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:03,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2413#true} {2413#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:03,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {2413#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:03,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {2413#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2413#true} is VALID [2022-04-14 19:35:03,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {2413#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#true} is VALID [2022-04-14 19:35:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 19:35:03,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40264131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:35:03,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:35:03,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 35 [2022-04-14 19:35:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31490742] [2022-04-14 19:35:03,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:35:03,882 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-14 19:35:03,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:35:03,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:35:03,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:35:03,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-14 19:35:03,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:35:03,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-14 19:35:03,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2022-04-14 19:35:03,966 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:35:22,017 WARN L232 SmtUtils]: Spent 14.55s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 19:35:24,883 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-14 19:35:26,894 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-14 19:35:28,901 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-14 19:35:40,456 WARN L232 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 19:35:50,802 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-14 19:35:55,717 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-14 19:35:58,033 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-14 19:36:04,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:36:06,141 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-14 19:36:08,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:36:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:36:08,805 INFO L93 Difference]: Finished difference Result 171 states and 214 transitions. [2022-04-14 19:36:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-14 19:36:08,806 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-14 19:36:08,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:36:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 106 transitions. [2022-04-14 19:36:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 106 transitions. [2022-04-14 19:36:08,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 106 transitions. [2022-04-14 19:36:22,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 101 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-14 19:36:22,883 INFO L225 Difference]: With dead ends: 171 [2022-04-14 19:36:22,883 INFO L226 Difference]: Without dead ends: 165 [2022-04-14 19:36:22,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=715, Invalid=3191, Unknown=0, NotChecked=0, Total=3906 [2022-04-14 19:36:22,884 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 45 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-04-14 19:36:22,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 88 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 678 Invalid, 7 Unknown, 0 Unchecked, 21.4s Time] [2022-04-14 19:36:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-14 19:36:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 109. [2022-04-14 19:36:22,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:36:22,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 109 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 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-14 19:36:22,889 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 109 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 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-14 19:36:22,890 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 109 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 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-14 19:36:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:36:22,893 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2022-04-14 19:36:22,893 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 203 transitions. [2022-04-14 19:36:22,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:36:22,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:36:22,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 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 165 states. [2022-04-14 19:36:22,894 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 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 165 states. [2022-04-14 19:36:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:36:22,897 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2022-04-14 19:36:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 203 transitions. [2022-04-14 19:36:22,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:36:22,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:36:22,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:36:22,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:36:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 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-14 19:36:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-14 19:36:22,900 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 41 [2022-04-14 19:36:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:36:22,900 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-14 19:36:22,900 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-14 19:36:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-14 19:36:22,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:36:22,900 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:36:22,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-14 19:36:23,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:36:23,116 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:36:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:36:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1797684346, now seen corresponding path program 5 times [2022-04-14 19:36:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:36:23,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843314539] [2022-04-14 19:36:23,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:36:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:36:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:23,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:36:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:23,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {3376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3362#true} is VALID [2022-04-14 19:36:23,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3362#true} {3362#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {3362#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:36:23,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {3376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3362#true} is VALID [2022-04-14 19:36:23,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {3362#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3362#true} {3362#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {3362#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {3362#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3367#(= main_~x~0 0)} is VALID [2022-04-14 19:36:23,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {3367#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3367#(= main_~x~0 0)} is VALID [2022-04-14 19:36:23,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {3367#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3367#(= main_~x~0 0)} is VALID [2022-04-14 19:36:23,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {3367#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:23,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {3368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:23,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {3368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:23,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {3368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:23,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {3369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:23,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {3369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:23,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {3369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:23,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {3370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:23,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:23,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {3370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:23,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {3371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:23,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {3371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:23,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {3371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:23,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {3372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:23,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {3372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:23,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {3372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:23,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {3373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:23,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {3373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:23,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {3373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:23,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {3374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:23,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {3374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:23,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {3374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3375#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-14 19:36:23,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {3375#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3375#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-14 19:36:23,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {3375#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3363#false} is VALID [2022-04-14 19:36:23,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:23,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {3363#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {3363#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {3363#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {3363#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {3363#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {3363#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {3363#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L272 TraceCheckUtils]: 43: Hoare triple {3363#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {3363#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {3363#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {3363#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 95 proven. 100 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 19:36:23,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:36:23,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843314539] [2022-04-14 19:36:23,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843314539] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:36:23,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204292644] [2022-04-14 19:36:23,326 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-14 19:36:23,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:36:23,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:36:23,327 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 19:36:23,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 19:36:23,419 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-04-14 19:36:23,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 19:36:23,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-14 19:36:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:23,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:36:23,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {3362#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3362#true} is VALID [2022-04-14 19:36:23,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {3362#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3362#true} {3362#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {3362#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {3362#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:23,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:23,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3464#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:36:23,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {3464#(not (<= 5000000 (mod main_~x~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3468#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-14 19:36:23,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {3468#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3468#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-14 19:36:23,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {3468#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3475#(and (<= 5000000 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-14 19:36:23,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {3475#(and (<= 5000000 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3479#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-14 19:36:23,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {3479#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3479#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-14 19:36:23,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {3479#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {3363#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {3363#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {3363#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {3363#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {3363#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L272 TraceCheckUtils]: 43: Hoare triple {3363#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {3363#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3363#false} is VALID [2022-04-14 19:36:23,973 INFO L290 TraceCheckUtils]: 45: Hoare triple {3363#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {3363#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 123 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 19:36:23,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:36:24,197 INFO L290 TraceCheckUtils]: 46: Hoare triple {3363#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:24,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {3363#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:24,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {3363#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3363#false} is VALID [2022-04-14 19:36:24,198 INFO L272 TraceCheckUtils]: 43: Hoare triple {3363#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {3363#false} is VALID [2022-04-14 19:36:24,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {3363#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:24,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:24,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {3363#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3363#false} is VALID [2022-04-14 19:36:24,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {3363#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:24,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:24,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {3363#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:24,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {3363#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:24,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {3363#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3363#false} is VALID [2022-04-14 19:36:24,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {3558#(<= 5000000 (mod main_~x~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3363#false} is VALID [2022-04-14 19:36:24,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {3558#(<= 5000000 (mod main_~x~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3558#(<= 5000000 (mod main_~x~0 4294967296))} is VALID [2022-04-14 19:36:24,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {3565#(<= 5000000 (mod (+ main_~x~0 1) 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3558#(<= 5000000 (mod main_~x~0 4294967296))} is VALID [2022-04-14 19:36:24,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {3569#(or (not (<= 5000000 (mod main_~x~0 4294967296))) (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3565#(<= 5000000 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-14 19:36:24,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3569#(or (not (<= 5000000 (mod main_~x~0 4294967296))) (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:36:24,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {3362#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {3362#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3362#true} is VALID [2022-04-14 19:36:24,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {3362#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3362#true} {3362#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {3362#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3362#true} is VALID [2022-04-14 19:36:24,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {3362#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3362#true} is VALID [2022-04-14 19:36:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 110 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-14 19:36:24,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204292644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:36:24,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:36:24,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 19 [2022-04-14 19:36:24,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465250961] [2022-04-14 19:36:24,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:36:24,206 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-14 19:36:24,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:36:24,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:24,255 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-14 19:36:24,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-14 19:36:24,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:36:24,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-14 19:36:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-04-14 19:36:24,256 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:36:25,114 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2022-04-14 19:36:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-14 19:36:25,114 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-14 19:36:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:36:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-14 19:36:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-14 19:36:25,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 60 transitions. [2022-04-14 19:36:25,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:36:25,185 INFO L225 Difference]: With dead ends: 122 [2022-04-14 19:36:25,185 INFO L226 Difference]: Without dead ends: 74 [2022-04-14 19:36:25,186 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2022-04-14 19:36:25,186 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 76 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 19:36:25,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 42 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 19:36:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-14 19:36:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-14 19:36:25,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:36:25,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:25,189 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:25,189 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:36:25,190 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-14 19:36:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-14 19:36:25,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:36:25,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:36:25,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-14 19:36:25,191 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-14 19:36:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:36:25,192 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-14 19:36:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-14 19:36:25,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:36:25,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:36:25,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:36:25,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:36:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-14 19:36:25,194 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 47 [2022-04-14 19:36:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:36:25,194 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-14 19:36:25,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-14 19:36:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-14 19:36:25,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:36:25,194 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:36:25,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 19:36:25,398 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:36:25,398 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:36:25,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:36:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash -748666459, now seen corresponding path program 6 times [2022-04-14 19:36:25,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:36:25,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554763140] [2022-04-14 19:36:25,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:36:25,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:36:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:25,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:36:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:25,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {4058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4035#true} is VALID [2022-04-14 19:36:25,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {4035#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:25,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4035#true} {4035#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:25,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {4035#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:36:25,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {4058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4035#true} is VALID [2022-04-14 19:36:25,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:25,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#true} {4035#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:25,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {4035#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:25,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {4035#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4040#(= main_~x~0 0)} is VALID [2022-04-14 19:36:25,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {4040#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4040#(= main_~x~0 0)} is VALID [2022-04-14 19:36:25,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {4040#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4040#(= main_~x~0 0)} is VALID [2022-04-14 19:36:25,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {4040#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4041#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:25,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {4041#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4041#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:25,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {4041#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4041#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:25,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {4041#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4042#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:25,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {4042#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4042#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:25,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {4042#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4042#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:25,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {4042#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4043#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:25,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {4043#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4043#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:25,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {4043#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4043#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:25,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {4043#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:25,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {4044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:25,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {4044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:25,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {4044#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4045#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:25,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {4045#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4045#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:25,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {4045#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4045#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:25,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {4045#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4046#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:25,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {4046#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4046#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:25,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {4046#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4046#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:25,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {4046#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4047#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:25,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {4047#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4047#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:25,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {4047#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4047#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:25,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {4047#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4048#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:36:25,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {4048#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4048#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:36:25,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {4048#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4048#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:36:25,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {4048#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4049#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:36:25,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {4049#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4049#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:36:25,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {4049#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4049#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:36:25,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {4049#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4050#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:36:25,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {4050#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4050#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:36:25,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {4050#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4050#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:36:25,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {4050#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4051#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:36:25,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {4051#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4051#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:36:25,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {4051#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4051#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:36:25,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {4051#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4052#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:36:25,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {4052#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4052#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:36:25,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {4052#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4052#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:36:25,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {4052#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4053#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:36:25,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {4053#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4053#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:36:25,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {4053#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4053#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:36:25,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {4053#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4054#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:36:25,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {4054#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4054#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:36:25,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {4054#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4054#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:36:25,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {4054#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4055#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:36:25,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {4055#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4055#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:36:25,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {4055#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4055#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:36:25,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {4055#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4056#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:36:25,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {4056#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4056#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:36:25,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {4056#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4056#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:36:25,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {4056#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4057#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-14 19:36:25,799 INFO L290 TraceCheckUtils]: 57: Hoare triple {4057#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4057#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-14 19:36:25,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {4057#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4036#false} is VALID [2022-04-14 19:36:25,800 INFO L290 TraceCheckUtils]: 59: Hoare triple {4036#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4036#false} is VALID [2022-04-14 19:36:25,800 INFO L290 TraceCheckUtils]: 60: Hoare triple {4036#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4036#false} is VALID [2022-04-14 19:36:25,800 INFO L272 TraceCheckUtils]: 61: Hoare triple {4036#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4036#false} is VALID [2022-04-14 19:36:25,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {4036#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4036#false} is VALID [2022-04-14 19:36:25,801 INFO L290 TraceCheckUtils]: 63: Hoare triple {4036#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4036#false} is VALID [2022-04-14 19:36:25,801 INFO L290 TraceCheckUtils]: 64: Hoare triple {4036#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4036#false} is VALID [2022-04-14 19:36:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 35 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:36:25,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:36:25,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554763140] [2022-04-14 19:36:25,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554763140] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:36:25,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441981999] [2022-04-14 19:36:25,802 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-14 19:36:25,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:36:25,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:36:25,803 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 19:36:25,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 19:36:25,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-14 19:36:25,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 19:36:25,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 19:36:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:25,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:36:26,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {4035#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:26,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {4035#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4035#true} is VALID [2022-04-14 19:36:26,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:26,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#true} {4035#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:26,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {4035#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:26,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {4035#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,360 INFO L290 TraceCheckUtils]: 42: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,363 INFO L290 TraceCheckUtils]: 51: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:36:26,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {4077#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4237#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-14 19:36:26,366 INFO L290 TraceCheckUtils]: 59: Hoare triple {4237#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4237#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-14 19:36:26,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {4237#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4244#(and (= 5000000 (+ (- 1) main_~z~0)) (not (< (mod main_~x~0 4294967296) 10000000)))} is VALID [2022-04-14 19:36:26,367 INFO L272 TraceCheckUtils]: 61: Hoare triple {4244#(and (= 5000000 (+ (- 1) main_~z~0)) (not (< (mod main_~x~0 4294967296) 10000000)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:36:26,367 INFO L290 TraceCheckUtils]: 62: Hoare triple {4248#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:36:26,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {4252#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4036#false} is VALID [2022-04-14 19:36:26,368 INFO L290 TraceCheckUtils]: 64: Hoare triple {4036#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4036#false} is VALID [2022-04-14 19:36:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-14 19:36:26,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:36:26,843 INFO L290 TraceCheckUtils]: 64: Hoare triple {4036#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4036#false} is VALID [2022-04-14 19:36:26,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {4252#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4036#false} is VALID [2022-04-14 19:36:26,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {4248#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:36:26,845 INFO L272 TraceCheckUtils]: 61: Hoare triple {4268#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:36:26,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {4272#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4268#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:36:26,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {4272#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4272#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4272#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,854 INFO L290 TraceCheckUtils]: 55: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,857 INFO L290 TraceCheckUtils]: 49: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,857 INFO L290 TraceCheckUtils]: 48: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {4035#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4279#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-14 19:36:26,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {4035#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:26,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#true} {4035#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:26,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:26,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {4035#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4035#true} is VALID [2022-04-14 19:36:26,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {4035#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4035#true} is VALID [2022-04-14 19:36:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-14 19:36:26,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441981999] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:36:26,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:36:26,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 29 [2022-04-14 19:36:26,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851849364] [2022-04-14 19:36:26,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:36:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-14 19:36:26,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:36:26,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:26,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:36:26,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-14 19:36:26,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:36:26,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-14 19:36:26,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-04-14 19:36:26,941 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:36:29,531 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-14 19:36:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-14 19:36:29,531 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-14 19:36:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:36:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 93 transitions. [2022-04-14 19:36:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 93 transitions. [2022-04-14 19:36:29,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 93 transitions. [2022-04-14 19:36:29,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:36:29,621 INFO L225 Difference]: With dead ends: 87 [2022-04-14 19:36:29,621 INFO L226 Difference]: Without dead ends: 82 [2022-04-14 19:36:29,622 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=439, Invalid=2753, Unknown=0, NotChecked=0, Total=3192 [2022-04-14 19:36:29,623 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 162 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:36:29,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 82 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-14 19:36:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-14 19:36:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-04-14 19:36:29,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:36:29,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:29,627 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:29,627 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:36:29,629 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-14 19:36:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-14 19:36:29,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:36:29,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:36:29,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-14 19:36:29,633 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-14 19:36:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:36:29,635 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-14 19:36:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-14 19:36:29,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:36:29,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:36:29,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:36:29,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:36:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-04-14 19:36:29,637 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 65 [2022-04-14 19:36:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:36:29,637 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-04-14 19:36:29,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-04-14 19:36:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-14 19:36:29,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:36:29,649 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 18, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:36:29,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 19:36:29,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 19:36:29,863 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:36:29,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:36:29,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1474088538, now seen corresponding path program 7 times [2022-04-14 19:36:29,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:36:29,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810320983] [2022-04-14 19:36:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:36:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:36:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:30,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:36:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:30,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {4865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4841#true} is VALID [2022-04-14 19:36:30,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {4841#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:30,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4841#true} {4841#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:30,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {4841#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:36:30,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {4865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4841#true} is VALID [2022-04-14 19:36:30,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {4841#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:30,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4841#true} {4841#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:30,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {4841#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:30,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {4841#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4846#(= main_~x~0 0)} is VALID [2022-04-14 19:36:30,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {4846#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4846#(= main_~x~0 0)} is VALID [2022-04-14 19:36:30,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {4846#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4846#(= main_~x~0 0)} is VALID [2022-04-14 19:36:30,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {4846#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:30,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:30,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:30,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:30,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:30,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:30,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:30,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:30,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:30,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:30,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:30,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:30,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:30,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:30,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:30,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:30,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:30,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:30,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:30,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:30,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:30,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:36:30,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:36:30,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:36:30,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:36:30,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:36:30,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:36:30,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:36:30,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:36:30,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:36:30,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:36:30,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:36:30,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:36:30,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:36:30,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:36:30,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:36:30,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:36:30,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:36:30,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:36:30,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:36:30,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:36:30,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:36:30,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:36:30,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:36:30,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:36:30,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:36:30,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:36:30,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:36:30,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-14 19:36:30,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-14 19:36:30,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-14 19:36:30,285 INFO L290 TraceCheckUtils]: 59: Hoare triple {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4864#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-14 19:36:30,285 INFO L290 TraceCheckUtils]: 60: Hoare triple {4864#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4864#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 61: Hoare triple {4864#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 62: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {4842#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 64: Hoare triple {4842#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 66: Hoare triple {4842#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 67: Hoare triple {4842#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 68: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 69: Hoare triple {4842#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 70: Hoare triple {4842#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:30,286 INFO L290 TraceCheckUtils]: 71: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:30,287 INFO L290 TraceCheckUtils]: 72: Hoare triple {4842#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:30,287 INFO L272 TraceCheckUtils]: 73: Hoare triple {4842#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4842#false} is VALID [2022-04-14 19:36:30,287 INFO L290 TraceCheckUtils]: 74: Hoare triple {4842#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4842#false} is VALID [2022-04-14 19:36:30,287 INFO L290 TraceCheckUtils]: 75: Hoare triple {4842#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:30,287 INFO L290 TraceCheckUtils]: 76: Hoare triple {4842#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 19:36:30,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:36:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810320983] [2022-04-14 19:36:30,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810320983] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:36:30,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401371741] [2022-04-14 19:36:30,288 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-14 19:36:30,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:36:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:36:30,289 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 19:36:30,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-14 19:36:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:30,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-14 19:36:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:36:30,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:36:31,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {4841#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:31,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {4841#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4841#true} is VALID [2022-04-14 19:36:31,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {4841#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:31,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4841#true} {4841#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:31,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {4841#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:31,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {4841#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4846#(= main_~x~0 0)} is VALID [2022-04-14 19:36:31,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {4846#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4846#(= main_~x~0 0)} is VALID [2022-04-14 19:36:31,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {4846#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4846#(= main_~x~0 0)} is VALID [2022-04-14 19:36:31,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {4846#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:31,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:31,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:36:31,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {4847#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:31,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:31,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:36:31,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {4848#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:31,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:31,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:36:31,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {4849#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:31,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:31,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:36:31,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {4850#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:31,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:31,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:36:31,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {4851#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:31,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:31,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:36:31,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {4852#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:31,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:31,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:36:31,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {4853#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:36:31,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:36:31,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:36:31,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {4854#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:36:31,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:36:31,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:36:31,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {4855#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:36:31,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:36:31,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:36:31,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {4856#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:36:31,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:36:31,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:36:31,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {4857#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:36:31,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:36:31,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:36:31,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {4858#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:36:31,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:36:31,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:36:31,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {4859#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:36:31,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:36:31,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:36:31,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {4860#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:36:31,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:36:31,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:36:31,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {4861#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:36:31,074 INFO L290 TraceCheckUtils]: 54: Hoare triple {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:36:31,074 INFO L290 TraceCheckUtils]: 55: Hoare triple {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:36:31,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {4862#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-14 19:36:31,075 INFO L290 TraceCheckUtils]: 57: Hoare triple {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-14 19:36:31,076 INFO L290 TraceCheckUtils]: 58: Hoare triple {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-14 19:36:31,076 INFO L290 TraceCheckUtils]: 59: Hoare triple {4863#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-14 19:36:31,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {5046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-14 19:36:31,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {5046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-14 19:36:31,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {5046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5056#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-14 19:36:31,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {5056#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5056#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-14 19:36:31,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {5056#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:31,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {4842#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {4842#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {4842#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 70: Hoare triple {4842#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 71: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 72: Hoare triple {4842#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L272 TraceCheckUtils]: 73: Hoare triple {4842#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {4842#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 75: Hoare triple {4842#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {4842#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-14 19:36:31,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:36:31,960 INFO L290 TraceCheckUtils]: 76: Hoare triple {4842#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,960 INFO L290 TraceCheckUtils]: 75: Hoare triple {4842#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,960 INFO L290 TraceCheckUtils]: 74: Hoare triple {4842#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4842#false} is VALID [2022-04-14 19:36:31,960 INFO L272 TraceCheckUtils]: 73: Hoare triple {4842#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4842#false} is VALID [2022-04-14 19:36:31,960 INFO L290 TraceCheckUtils]: 72: Hoare triple {4842#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,960 INFO L290 TraceCheckUtils]: 71: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:31,960 INFO L290 TraceCheckUtils]: 70: Hoare triple {4842#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:31,960 INFO L290 TraceCheckUtils]: 69: Hoare triple {4842#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,961 INFO L290 TraceCheckUtils]: 68: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:31,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {4842#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:31,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {4842#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4842#false} is VALID [2022-04-14 19:36:31,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {4842#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4842#false} is VALID [2022-04-14 19:36:31,961 INFO L290 TraceCheckUtils]: 64: Hoare triple {5135#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4842#false} is VALID [2022-04-14 19:36:31,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {5135#(not (<= 5000000 (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5135#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:36:31,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {5142#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5135#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:36:31,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {5142#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5142#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:36:31,963 INFO L290 TraceCheckUtils]: 60: Hoare triple {5142#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5142#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:36:31,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {5152#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5142#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:36:31,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {5152#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5152#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-14 19:36:31,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {5152#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5152#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-14 19:36:31,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {5162#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5152#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-14 19:36:31,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {5162#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5162#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-14 19:36:31,965 INFO L290 TraceCheckUtils]: 54: Hoare triple {5162#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5162#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-14 19:36:31,966 INFO L290 TraceCheckUtils]: 53: Hoare triple {5172#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5162#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-14 19:36:31,966 INFO L290 TraceCheckUtils]: 52: Hoare triple {5172#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5172#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:36:31,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {5172#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5172#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:36:31,968 INFO L290 TraceCheckUtils]: 50: Hoare triple {5182#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5172#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:36:31,968 INFO L290 TraceCheckUtils]: 49: Hoare triple {5182#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5182#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:36:31,968 INFO L290 TraceCheckUtils]: 48: Hoare triple {5182#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5182#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:36:31,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {5192#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5182#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:36:31,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {5192#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5192#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:36:31,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {5192#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5192#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:36:31,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {5202#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5192#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:36:31,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {5202#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5202#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:36:31,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {5202#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5202#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:36:31,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {5212#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5202#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:36:31,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {5212#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5212#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-14 19:36:31,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {5212#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5212#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-14 19:36:31,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {5222#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5212#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-14 19:36:31,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {5222#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5222#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-14 19:36:31,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {5222#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5222#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-14 19:36:31,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {5232#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5222#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-14 19:36:31,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {5232#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5232#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-14 19:36:31,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {5232#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5232#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-14 19:36:31,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {5242#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5232#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-14 19:36:31,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {5242#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5242#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-14 19:36:31,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {5242#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5242#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-14 19:36:31,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {5252#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5242#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-14 19:36:31,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {5252#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5252#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-14 19:36:31,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {5252#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5252#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-14 19:36:31,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {5262#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5252#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-14 19:36:31,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {5262#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5262#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-14 19:36:31,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {5262#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5262#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-14 19:36:31,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {5272#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5262#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-14 19:36:31,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {5272#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5272#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-14 19:36:31,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {5272#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5272#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-14 19:36:31,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {5282#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5272#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-14 19:36:31,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {5282#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5282#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-14 19:36:31,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {5282#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5282#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-14 19:36:31,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {5292#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5282#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-14 19:36:31,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {5292#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5292#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-14 19:36:31,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {5292#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5292#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-14 19:36:31,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {5302#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5292#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-14 19:36:31,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {5302#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5302#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-14 19:36:31,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {5302#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5302#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-14 19:36:31,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {5312#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5302#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-14 19:36:31,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {5312#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5312#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-14 19:36:31,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {5312#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5312#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-14 19:36:31,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {5322#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5312#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-14 19:36:31,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {5322#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5322#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:36:31,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {5322#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5322#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:36:31,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {4841#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {5322#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:36:31,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {4841#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:31,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4841#true} {4841#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:31,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {4841#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:31,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {4841#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4841#true} is VALID [2022-04-14 19:36:31,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {4841#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#true} is VALID [2022-04-14 19:36:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-14 19:36:31,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401371741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:36:31,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:36:31,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2022-04-14 19:36:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775252601] [2022-04-14 19:36:31,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:36:31,988 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-14 19:36:31,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:36:31,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:36:32,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:36:32,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-14 19:36:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:36:32,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-14 19:36:32,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=1368, Unknown=0, NotChecked=0, Total=1892 [2022-04-14 19:36:32,083 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:37:35,428 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-14 19:37:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-14 19:37:35,428 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-14 19:37:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:37:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 157 transitions. [2022-04-14 19:37:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 157 transitions. [2022-04-14 19:37:35,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 157 transitions. [2022-04-14 19:37:35,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:37:35,664 INFO L225 Difference]: With dead ends: 144 [2022-04-14 19:37:35,664 INFO L226 Difference]: Without dead ends: 144 [2022-04-14 19:37:35,665 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 61.9s TimeCoverageRelationStatistics Valid=1882, Invalid=5089, Unknown=1, NotChecked=0, Total=6972 [2022-04-14 19:37:35,665 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 170 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:37:35,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 119 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-14 19:37:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-14 19:37:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-04-14 19:37:35,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:37:35,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:35,671 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:35,671 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:37:35,677 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-14 19:37:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-14 19:37:35,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:37:35,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:37:35,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-14 19:37:35,678 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-14 19:37:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:37:35,680 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-14 19:37:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-14 19:37:35,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:37:35,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:37:35,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:37:35,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:37:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-04-14 19:37:35,682 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 77 [2022-04-14 19:37:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:37:35,682 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-04-14 19:37:35,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-14 19:37:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-14 19:37:35,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:37:35,683 INFO L499 BasicCegarLoop]: trace histogram [44, 44, 40, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:37:35,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-14 19:37:35,898 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:37:35,899 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:37:35,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:37:35,900 INFO L85 PathProgramCache]: Analyzing trace with hash 439564262, now seen corresponding path program 8 times [2022-04-14 19:37:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:37:35,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423686795] [2022-04-14 19:37:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:37:35,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:37:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:37:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:37:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:37:36,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {6051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6005#true} is VALID [2022-04-14 19:37:36,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {6005#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:36,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6005#true} {6005#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:36,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {6005#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:37:36,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {6051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6005#true} is VALID [2022-04-14 19:37:36,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {6005#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:36,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6005#true} {6005#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:36,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {6005#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:36,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {6005#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {6010#(= main_~x~0 0)} is VALID [2022-04-14 19:37:36,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {6010#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6010#(= main_~x~0 0)} is VALID [2022-04-14 19:37:36,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {6010#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6010#(= main_~x~0 0)} is VALID [2022-04-14 19:37:36,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {6010#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6011#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:37:36,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {6011#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6011#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:37:36,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {6011#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6011#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-14 19:37:36,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {6011#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6012#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:37:36,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {6012#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6012#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:37:36,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {6012#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6012#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-14 19:37:36,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {6012#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6013#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:37:36,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {6013#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6013#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:37:36,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {6013#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6013#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-14 19:37:36,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {6013#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:37:36,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {6014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:37:36,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {6014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-14 19:37:36,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {6014#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6015#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:37:36,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {6015#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6015#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:37:36,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {6015#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6015#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-14 19:37:36,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {6015#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6016#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:37:36,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {6016#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6016#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:37:36,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {6016#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6016#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-14 19:37:36,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {6016#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6017#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:37:36,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {6017#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6017#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:37:36,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {6017#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6017#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-14 19:37:36,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {6017#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6018#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:37:36,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {6018#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6018#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:37:36,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {6018#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6018#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-14 19:37:36,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {6018#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6019#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:37:36,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {6019#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6019#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:37:36,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {6019#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6019#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-14 19:37:36,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {6019#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6020#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:37:36,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {6020#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6020#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:37:36,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {6020#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6020#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-14 19:37:36,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {6020#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6021#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:37:36,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {6021#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6021#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:37:36,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {6021#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6021#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-14 19:37:36,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {6021#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6022#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:37:36,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {6022#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6022#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:37:36,968 INFO L290 TraceCheckUtils]: 43: Hoare triple {6022#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6022#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-14 19:37:36,968 INFO L290 TraceCheckUtils]: 44: Hoare triple {6022#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6023#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:37:36,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {6023#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6023#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:37:36,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {6023#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6023#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-14 19:37:36,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {6023#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6024#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:37:36,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {6024#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6024#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:37:36,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {6024#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6024#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-14 19:37:36,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {6024#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6025#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:37:36,970 INFO L290 TraceCheckUtils]: 51: Hoare triple {6025#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6025#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:37:36,971 INFO L290 TraceCheckUtils]: 52: Hoare triple {6025#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6025#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-14 19:37:36,971 INFO L290 TraceCheckUtils]: 53: Hoare triple {6025#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6026#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:37:36,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {6026#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6026#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:37:36,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {6026#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6026#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-14 19:37:36,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {6026#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6027#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-14 19:37:36,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {6027#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6027#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-14 19:37:36,973 INFO L290 TraceCheckUtils]: 58: Hoare triple {6027#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6027#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-14 19:37:36,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {6027#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6028#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-14 19:37:36,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {6028#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6028#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-14 19:37:36,974 INFO L290 TraceCheckUtils]: 61: Hoare triple {6028#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6028#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-14 19:37:36,974 INFO L290 TraceCheckUtils]: 62: Hoare triple {6028#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6029#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-14 19:37:36,975 INFO L290 TraceCheckUtils]: 63: Hoare triple {6029#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6029#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-14 19:37:36,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {6029#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6029#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-14 19:37:36,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {6029#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6030#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-14 19:37:36,976 INFO L290 TraceCheckUtils]: 66: Hoare triple {6030#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6030#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-14 19:37:36,976 INFO L290 TraceCheckUtils]: 67: Hoare triple {6030#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6030#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-14 19:37:36,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {6030#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6031#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-14 19:37:36,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {6031#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6031#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-14 19:37:36,978 INFO L290 TraceCheckUtils]: 70: Hoare triple {6031#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6031#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-14 19:37:36,978 INFO L290 TraceCheckUtils]: 71: Hoare triple {6031#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6032#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-14 19:37:36,978 INFO L290 TraceCheckUtils]: 72: Hoare triple {6032#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6032#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-14 19:37:36,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {6032#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6032#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-14 19:37:36,979 INFO L290 TraceCheckUtils]: 74: Hoare triple {6032#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6033#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-14 19:37:36,979 INFO L290 TraceCheckUtils]: 75: Hoare triple {6033#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6033#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-14 19:37:36,980 INFO L290 TraceCheckUtils]: 76: Hoare triple {6033#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6033#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-14 19:37:36,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {6033#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6034#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-14 19:37:36,981 INFO L290 TraceCheckUtils]: 78: Hoare triple {6034#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6034#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-14 19:37:36,981 INFO L290 TraceCheckUtils]: 79: Hoare triple {6034#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6034#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-14 19:37:36,982 INFO L290 TraceCheckUtils]: 80: Hoare triple {6034#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6035#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-14 19:37:36,982 INFO L290 TraceCheckUtils]: 81: Hoare triple {6035#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6035#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-14 19:37:36,982 INFO L290 TraceCheckUtils]: 82: Hoare triple {6035#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6035#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-14 19:37:36,984 INFO L290 TraceCheckUtils]: 83: Hoare triple {6035#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-14 19:37:36,984 INFO L290 TraceCheckUtils]: 84: Hoare triple {6036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-14 19:37:36,984 INFO L290 TraceCheckUtils]: 85: Hoare triple {6036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-14 19:37:36,985 INFO L290 TraceCheckUtils]: 86: Hoare triple {6036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6037#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-14 19:37:36,985 INFO L290 TraceCheckUtils]: 87: Hoare triple {6037#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6037#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-14 19:37:36,985 INFO L290 TraceCheckUtils]: 88: Hoare triple {6037#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6037#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-14 19:37:36,986 INFO L290 TraceCheckUtils]: 89: Hoare triple {6037#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6038#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-14 19:37:36,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {6038#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6038#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-14 19:37:36,986 INFO L290 TraceCheckUtils]: 91: Hoare triple {6038#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6038#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-14 19:37:36,987 INFO L290 TraceCheckUtils]: 92: Hoare triple {6038#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6039#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-14 19:37:36,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {6039#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6039#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-14 19:37:36,988 INFO L290 TraceCheckUtils]: 94: Hoare triple {6039#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6039#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-14 19:37:36,988 INFO L290 TraceCheckUtils]: 95: Hoare triple {6039#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6040#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-14 19:37:36,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {6040#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6040#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-14 19:37:36,989 INFO L290 TraceCheckUtils]: 97: Hoare triple {6040#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6040#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-14 19:37:36,989 INFO L290 TraceCheckUtils]: 98: Hoare triple {6040#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6041#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-14 19:37:36,989 INFO L290 TraceCheckUtils]: 99: Hoare triple {6041#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6041#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-14 19:37:36,990 INFO L290 TraceCheckUtils]: 100: Hoare triple {6041#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6041#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-14 19:37:36,990 INFO L290 TraceCheckUtils]: 101: Hoare triple {6041#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6042#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-14 19:37:36,990 INFO L290 TraceCheckUtils]: 102: Hoare triple {6042#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6042#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-14 19:37:36,991 INFO L290 TraceCheckUtils]: 103: Hoare triple {6042#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6042#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-14 19:37:36,991 INFO L290 TraceCheckUtils]: 104: Hoare triple {6042#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6043#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-14 19:37:36,991 INFO L290 TraceCheckUtils]: 105: Hoare triple {6043#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6043#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-14 19:37:36,992 INFO L290 TraceCheckUtils]: 106: Hoare triple {6043#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6043#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-14 19:37:36,992 INFO L290 TraceCheckUtils]: 107: Hoare triple {6043#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6044#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-14 19:37:36,992 INFO L290 TraceCheckUtils]: 108: Hoare triple {6044#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6044#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-14 19:37:36,993 INFO L290 TraceCheckUtils]: 109: Hoare triple {6044#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6044#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-14 19:37:36,994 INFO L290 TraceCheckUtils]: 110: Hoare triple {6044#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6045#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-14 19:37:36,994 INFO L290 TraceCheckUtils]: 111: Hoare triple {6045#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6045#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-14 19:37:36,995 INFO L290 TraceCheckUtils]: 112: Hoare triple {6045#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6045#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-14 19:37:36,995 INFO L290 TraceCheckUtils]: 113: Hoare triple {6045#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6046#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-14 19:37:36,995 INFO L290 TraceCheckUtils]: 114: Hoare triple {6046#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6046#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-14 19:37:36,996 INFO L290 TraceCheckUtils]: 115: Hoare triple {6046#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6046#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-14 19:37:36,996 INFO L290 TraceCheckUtils]: 116: Hoare triple {6046#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6047#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-14 19:37:36,997 INFO L290 TraceCheckUtils]: 117: Hoare triple {6047#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6047#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-14 19:37:36,997 INFO L290 TraceCheckUtils]: 118: Hoare triple {6047#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6047#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-14 19:37:36,997 INFO L290 TraceCheckUtils]: 119: Hoare triple {6047#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6048#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-14 19:37:36,998 INFO L290 TraceCheckUtils]: 120: Hoare triple {6048#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6048#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-14 19:37:36,998 INFO L290 TraceCheckUtils]: 121: Hoare triple {6048#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6048#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-14 19:37:36,999 INFO L290 TraceCheckUtils]: 122: Hoare triple {6048#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6049#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-14 19:37:37,000 INFO L290 TraceCheckUtils]: 123: Hoare triple {6049#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6049#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-14 19:37:37,000 INFO L290 TraceCheckUtils]: 124: Hoare triple {6049#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6049#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-14 19:37:37,001 INFO L290 TraceCheckUtils]: 125: Hoare triple {6049#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6050#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-14 19:37:37,001 INFO L290 TraceCheckUtils]: 126: Hoare triple {6050#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6050#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-14 19:37:37,002 INFO L290 TraceCheckUtils]: 127: Hoare triple {6050#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6006#false} is VALID [2022-04-14 19:37:37,002 INFO L290 TraceCheckUtils]: 128: Hoare triple {6006#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6006#false} is VALID [2022-04-14 19:37:37,002 INFO L290 TraceCheckUtils]: 129: Hoare triple {6006#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:37,002 INFO L290 TraceCheckUtils]: 130: Hoare triple {6006#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6006#false} is VALID [2022-04-14 19:37:37,002 INFO L290 TraceCheckUtils]: 131: Hoare triple {6006#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6006#false} is VALID [2022-04-14 19:37:37,002 INFO L290 TraceCheckUtils]: 132: Hoare triple {6006#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:37,002 INFO L290 TraceCheckUtils]: 133: Hoare triple {6006#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6006#false} is VALID [2022-04-14 19:37:37,002 INFO L290 TraceCheckUtils]: 134: Hoare triple {6006#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6006#false} is VALID [2022-04-14 19:37:37,002 INFO L290 TraceCheckUtils]: 135: Hoare triple {6006#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:37,003 INFO L290 TraceCheckUtils]: 136: Hoare triple {6006#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6006#false} is VALID [2022-04-14 19:37:37,003 INFO L290 TraceCheckUtils]: 137: Hoare triple {6006#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6006#false} is VALID [2022-04-14 19:37:37,003 INFO L290 TraceCheckUtils]: 138: Hoare triple {6006#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:37,003 INFO L272 TraceCheckUtils]: 139: Hoare triple {6006#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {6006#false} is VALID [2022-04-14 19:37:37,003 INFO L290 TraceCheckUtils]: 140: Hoare triple {6006#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6006#false} is VALID [2022-04-14 19:37:37,003 INFO L290 TraceCheckUtils]: 141: Hoare triple {6006#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:37,003 INFO L290 TraceCheckUtils]: 142: Hoare triple {6006#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 447 proven. 2420 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 19:37:37,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:37:37,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423686795] [2022-04-14 19:37:37,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423686795] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:37:37,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806635125] [2022-04-14 19:37:37,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 19:37:37,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:37:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:37:37,006 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 19:37:37,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-14 19:37:37,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 19:37:37,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 19:37:37,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-14 19:37:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:37:37,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:37:39,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {6005#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:39,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {6005#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6005#true} is VALID [2022-04-14 19:37:39,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {6005#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:39,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6005#true} {6005#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:39,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {6005#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:39,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {6005#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {6070#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {6070#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6070#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6070#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {6070#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6080#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {6080#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6080#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {6080#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6080#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {6080#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6090#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-14 19:37:39,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {6090#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6090#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-14 19:37:39,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {6090#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6090#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-14 19:37:39,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {6090#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6100#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {6100#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6100#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {6100#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6100#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {6100#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6110#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-14 19:37:39,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {6110#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6110#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-14 19:37:39,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {6110#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6110#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-14 19:37:39,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {6110#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6120#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-14 19:37:39,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {6120#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6120#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-14 19:37:39,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {6120#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6120#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-14 19:37:39,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {6120#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6130#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {6130#(and (= main_~x~0 6) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6130#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {6130#(and (= main_~x~0 6) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6130#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {6130#(and (= main_~x~0 6) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6140#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {6140#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6140#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {6140#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6140#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {6140#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6150#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-14 19:37:39,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {6150#(and (= 5000000 main_~z~0) (= main_~x~0 8))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6150#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-14 19:37:39,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {6150#(and (= 5000000 main_~z~0) (= main_~x~0 8))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6150#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-14 19:37:39,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {6150#(and (= 5000000 main_~z~0) (= main_~x~0 8))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6160#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {6160#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6160#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {6160#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6160#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {6160#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6170#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {6170#(and (= main_~x~0 10) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6170#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {6170#(and (= main_~x~0 10) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6170#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {6170#(and (= main_~x~0 10) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6180#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {6180#(and (= main_~x~0 11) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6180#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {6180#(and (= main_~x~0 11) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6180#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {6180#(and (= main_~x~0 11) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6190#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {6190#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6190#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {6190#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6190#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {6190#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6200#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {6200#(and (= main_~x~0 13) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6200#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {6200#(and (= main_~x~0 13) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6200#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,839 INFO L290 TraceCheckUtils]: 47: Hoare triple {6200#(and (= main_~x~0 13) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6210#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {6210#(and (= main_~x~0 14) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6210#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {6210#(and (= main_~x~0 14) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6210#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {6210#(and (= main_~x~0 14) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6220#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {6220#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6220#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {6220#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6220#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {6220#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6230#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-14 19:37:39,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {6230#(and (= 5000000 main_~z~0) (= main_~x~0 16))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6230#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-14 19:37:39,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {6230#(and (= 5000000 main_~z~0) (= main_~x~0 16))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6230#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-14 19:37:39,843 INFO L290 TraceCheckUtils]: 56: Hoare triple {6230#(and (= 5000000 main_~z~0) (= main_~x~0 16))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6240#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,843 INFO L290 TraceCheckUtils]: 57: Hoare triple {6240#(and (= main_~x~0 17) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6240#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,844 INFO L290 TraceCheckUtils]: 58: Hoare triple {6240#(and (= main_~x~0 17) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6240#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,844 INFO L290 TraceCheckUtils]: 59: Hoare triple {6240#(and (= main_~x~0 17) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6250#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,844 INFO L290 TraceCheckUtils]: 60: Hoare triple {6250#(and (= main_~x~0 18) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6250#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {6250#(and (= main_~x~0 18) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6250#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {6250#(and (= main_~x~0 18) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6260#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {6260#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6260#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,846 INFO L290 TraceCheckUtils]: 64: Hoare triple {6260#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6260#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,846 INFO L290 TraceCheckUtils]: 65: Hoare triple {6260#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6270#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,846 INFO L290 TraceCheckUtils]: 66: Hoare triple {6270#(and (= main_~x~0 20) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6270#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,847 INFO L290 TraceCheckUtils]: 67: Hoare triple {6270#(and (= main_~x~0 20) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6270#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,847 INFO L290 TraceCheckUtils]: 68: Hoare triple {6270#(and (= main_~x~0 20) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6280#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-14 19:37:39,847 INFO L290 TraceCheckUtils]: 69: Hoare triple {6280#(and (= 5000000 main_~z~0) (= main_~x~0 21))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6280#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-14 19:37:39,848 INFO L290 TraceCheckUtils]: 70: Hoare triple {6280#(and (= 5000000 main_~z~0) (= main_~x~0 21))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6280#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-14 19:37:39,848 INFO L290 TraceCheckUtils]: 71: Hoare triple {6280#(and (= 5000000 main_~z~0) (= main_~x~0 21))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6290#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {6290#(and (= main_~x~0 22) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6290#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,849 INFO L290 TraceCheckUtils]: 73: Hoare triple {6290#(and (= main_~x~0 22) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6290#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,849 INFO L290 TraceCheckUtils]: 74: Hoare triple {6290#(and (= main_~x~0 22) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6300#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,849 INFO L290 TraceCheckUtils]: 75: Hoare triple {6300#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6300#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,850 INFO L290 TraceCheckUtils]: 76: Hoare triple {6300#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6300#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,850 INFO L290 TraceCheckUtils]: 77: Hoare triple {6300#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6310#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,853 INFO L290 TraceCheckUtils]: 78: Hoare triple {6310#(and (= main_~x~0 24) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6310#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,853 INFO L290 TraceCheckUtils]: 79: Hoare triple {6310#(and (= main_~x~0 24) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6310#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,853 INFO L290 TraceCheckUtils]: 80: Hoare triple {6310#(and (= main_~x~0 24) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6320#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {6320#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6320#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,857 INFO L290 TraceCheckUtils]: 82: Hoare triple {6320#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6320#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,857 INFO L290 TraceCheckUtils]: 83: Hoare triple {6320#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6330#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {6330#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6330#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,858 INFO L290 TraceCheckUtils]: 85: Hoare triple {6330#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6330#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,858 INFO L290 TraceCheckUtils]: 86: Hoare triple {6330#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6340#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,858 INFO L290 TraceCheckUtils]: 87: Hoare triple {6340#(and (= main_~x~0 27) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6340#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,859 INFO L290 TraceCheckUtils]: 88: Hoare triple {6340#(and (= main_~x~0 27) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6340#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,859 INFO L290 TraceCheckUtils]: 89: Hoare triple {6340#(and (= main_~x~0 27) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6350#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,859 INFO L290 TraceCheckUtils]: 90: Hoare triple {6350#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6350#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,860 INFO L290 TraceCheckUtils]: 91: Hoare triple {6350#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6350#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,860 INFO L290 TraceCheckUtils]: 92: Hoare triple {6350#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6360#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,860 INFO L290 TraceCheckUtils]: 93: Hoare triple {6360#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6360#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,861 INFO L290 TraceCheckUtils]: 94: Hoare triple {6360#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6360#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,861 INFO L290 TraceCheckUtils]: 95: Hoare triple {6360#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6370#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-14 19:37:39,861 INFO L290 TraceCheckUtils]: 96: Hoare triple {6370#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6370#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-14 19:37:39,862 INFO L290 TraceCheckUtils]: 97: Hoare triple {6370#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6370#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-14 19:37:39,862 INFO L290 TraceCheckUtils]: 98: Hoare triple {6370#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6380#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,863 INFO L290 TraceCheckUtils]: 99: Hoare triple {6380#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6380#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,863 INFO L290 TraceCheckUtils]: 100: Hoare triple {6380#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6380#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,863 INFO L290 TraceCheckUtils]: 101: Hoare triple {6380#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6390#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,864 INFO L290 TraceCheckUtils]: 102: Hoare triple {6390#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6390#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,864 INFO L290 TraceCheckUtils]: 103: Hoare triple {6390#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6390#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,864 INFO L290 TraceCheckUtils]: 104: Hoare triple {6390#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6400#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,865 INFO L290 TraceCheckUtils]: 105: Hoare triple {6400#(and (= main_~x~0 33) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6400#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,865 INFO L290 TraceCheckUtils]: 106: Hoare triple {6400#(and (= main_~x~0 33) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6400#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,865 INFO L290 TraceCheckUtils]: 107: Hoare triple {6400#(and (= main_~x~0 33) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6410#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,866 INFO L290 TraceCheckUtils]: 108: Hoare triple {6410#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6410#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,866 INFO L290 TraceCheckUtils]: 109: Hoare triple {6410#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6410#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,866 INFO L290 TraceCheckUtils]: 110: Hoare triple {6410#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6420#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,867 INFO L290 TraceCheckUtils]: 111: Hoare triple {6420#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6420#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,867 INFO L290 TraceCheckUtils]: 112: Hoare triple {6420#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6420#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,867 INFO L290 TraceCheckUtils]: 113: Hoare triple {6420#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6430#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-14 19:37:39,868 INFO L290 TraceCheckUtils]: 114: Hoare triple {6430#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6430#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-14 19:37:39,879 INFO L290 TraceCheckUtils]: 115: Hoare triple {6430#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6430#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-14 19:37:39,880 INFO L290 TraceCheckUtils]: 116: Hoare triple {6430#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6440#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,880 INFO L290 TraceCheckUtils]: 117: Hoare triple {6440#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6440#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,881 INFO L290 TraceCheckUtils]: 118: Hoare triple {6440#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6440#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,881 INFO L290 TraceCheckUtils]: 119: Hoare triple {6440#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6450#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,882 INFO L290 TraceCheckUtils]: 120: Hoare triple {6450#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6450#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,882 INFO L290 TraceCheckUtils]: 121: Hoare triple {6450#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6450#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,882 INFO L290 TraceCheckUtils]: 122: Hoare triple {6450#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6460#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-14 19:37:39,883 INFO L290 TraceCheckUtils]: 123: Hoare triple {6460#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6460#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-14 19:37:39,883 INFO L290 TraceCheckUtils]: 124: Hoare triple {6460#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6460#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-14 19:37:39,884 INFO L290 TraceCheckUtils]: 125: Hoare triple {6460#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6470#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,884 INFO L290 TraceCheckUtils]: 126: Hoare triple {6470#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6470#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-14 19:37:39,884 INFO L290 TraceCheckUtils]: 127: Hoare triple {6470#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6477#(and (= 40 main_~x~0) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-14 19:37:39,885 INFO L290 TraceCheckUtils]: 128: Hoare triple {6477#(and (= 40 main_~x~0) (= 5000000 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6481#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} is VALID [2022-04-14 19:37:39,885 INFO L290 TraceCheckUtils]: 129: Hoare triple {6481#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6481#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} is VALID [2022-04-14 19:37:39,886 INFO L290 TraceCheckUtils]: 130: Hoare triple {6481#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6488#(and (= 5000002 main_~z~0) (= 41 main_~x~0))} is VALID [2022-04-14 19:37:39,886 INFO L290 TraceCheckUtils]: 131: Hoare triple {6488#(and (= 5000002 main_~z~0) (= 41 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6492#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} is VALID [2022-04-14 19:37:39,886 INFO L290 TraceCheckUtils]: 132: Hoare triple {6492#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6492#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} is VALID [2022-04-14 19:37:39,887 INFO L290 TraceCheckUtils]: 133: Hoare triple {6492#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6499#(and (= 41 (+ (- 1) main_~x~0)) (= 5000003 main_~z~0))} is VALID [2022-04-14 19:37:39,887 INFO L290 TraceCheckUtils]: 134: Hoare triple {6499#(and (= 41 (+ (- 1) main_~x~0)) (= 5000003 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6503#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} is VALID [2022-04-14 19:37:39,888 INFO L290 TraceCheckUtils]: 135: Hoare triple {6503#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6503#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} is VALID [2022-04-14 19:37:39,888 INFO L290 TraceCheckUtils]: 136: Hoare triple {6503#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6510#(and (= 41 (+ (- 2) main_~x~0)) (= 5000004 main_~z~0))} is VALID [2022-04-14 19:37:39,889 INFO L290 TraceCheckUtils]: 137: Hoare triple {6510#(and (= 41 (+ (- 2) main_~x~0)) (= 5000004 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6514#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} is VALID [2022-04-14 19:37:39,889 INFO L290 TraceCheckUtils]: 138: Hoare triple {6514#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {6514#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} is VALID [2022-04-14 19:37:39,890 INFO L272 TraceCheckUtils]: 139: Hoare triple {6514#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {6521#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:37:39,890 INFO L290 TraceCheckUtils]: 140: Hoare triple {6521#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6525#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:37:39,890 INFO L290 TraceCheckUtils]: 141: Hoare triple {6525#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:39,890 INFO L290 TraceCheckUtils]: 142: Hoare triple {6006#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:37:39,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:37:44,238 INFO L290 TraceCheckUtils]: 142: Hoare triple {6006#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:44,239 INFO L290 TraceCheckUtils]: 141: Hoare triple {6525#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6006#false} is VALID [2022-04-14 19:37:44,239 INFO L290 TraceCheckUtils]: 140: Hoare triple {6521#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6525#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:37:44,239 INFO L272 TraceCheckUtils]: 139: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {6521#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:37:44,240 INFO L290 TraceCheckUtils]: 138: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,253 INFO L290 TraceCheckUtils]: 137: Hoare triple {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,258 INFO L290 TraceCheckUtils]: 136: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:37:44,258 INFO L290 TraceCheckUtils]: 135: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,259 INFO L290 TraceCheckUtils]: 134: Hoare triple {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,264 INFO L290 TraceCheckUtils]: 133: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:37:44,265 INFO L290 TraceCheckUtils]: 132: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,266 INFO L290 TraceCheckUtils]: 131: Hoare triple {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,275 INFO L290 TraceCheckUtils]: 130: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:37:44,275 INFO L290 TraceCheckUtils]: 129: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,276 INFO L290 TraceCheckUtils]: 128: Hoare triple {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,282 INFO L290 TraceCheckUtils]: 127: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:37:44,283 INFO L290 TraceCheckUtils]: 126: Hoare triple {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,283 INFO L290 TraceCheckUtils]: 125: Hoare triple {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6541#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-14 19:37:44,284 INFO L290 TraceCheckUtils]: 124: Hoare triple {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:37:44,284 INFO L290 TraceCheckUtils]: 123: Hoare triple {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:37:44,284 INFO L290 TraceCheckUtils]: 122: Hoare triple {6594#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6548#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-14 19:37:44,285 INFO L290 TraceCheckUtils]: 121: Hoare triple {6594#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6594#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,285 INFO L290 TraceCheckUtils]: 120: Hoare triple {6594#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6594#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,286 INFO L290 TraceCheckUtils]: 119: Hoare triple {6604#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6594#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,286 INFO L290 TraceCheckUtils]: 118: Hoare triple {6604#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6604#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,286 INFO L290 TraceCheckUtils]: 117: Hoare triple {6604#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6604#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,287 INFO L290 TraceCheckUtils]: 116: Hoare triple {6614#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6604#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,287 INFO L290 TraceCheckUtils]: 115: Hoare triple {6614#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6614#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:37:44,288 INFO L290 TraceCheckUtils]: 114: Hoare triple {6614#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6614#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:37:44,288 INFO L290 TraceCheckUtils]: 113: Hoare triple {6624#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6614#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-14 19:37:44,289 INFO L290 TraceCheckUtils]: 112: Hoare triple {6624#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6624#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,289 INFO L290 TraceCheckUtils]: 111: Hoare triple {6624#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6624#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,289 INFO L290 TraceCheckUtils]: 110: Hoare triple {6634#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6624#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,290 INFO L290 TraceCheckUtils]: 109: Hoare triple {6634#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6634#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:37:44,290 INFO L290 TraceCheckUtils]: 108: Hoare triple {6634#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6634#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:37:44,291 INFO L290 TraceCheckUtils]: 107: Hoare triple {6644#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6634#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-14 19:37:44,291 INFO L290 TraceCheckUtils]: 106: Hoare triple {6644#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6644#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,291 INFO L290 TraceCheckUtils]: 105: Hoare triple {6644#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6644#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,292 INFO L290 TraceCheckUtils]: 104: Hoare triple {6654#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6644#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,292 INFO L290 TraceCheckUtils]: 103: Hoare triple {6654#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6654#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-14 19:37:44,292 INFO L290 TraceCheckUtils]: 102: Hoare triple {6654#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6654#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-14 19:37:44,293 INFO L290 TraceCheckUtils]: 101: Hoare triple {6664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6654#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-14 19:37:44,294 INFO L290 TraceCheckUtils]: 100: Hoare triple {6664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-14 19:37:44,294 INFO L290 TraceCheckUtils]: 99: Hoare triple {6664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-14 19:37:44,295 INFO L290 TraceCheckUtils]: 98: Hoare triple {6674#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-14 19:37:44,295 INFO L290 TraceCheckUtils]: 97: Hoare triple {6674#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6674#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,296 INFO L290 TraceCheckUtils]: 96: Hoare triple {6674#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6674#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,296 INFO L290 TraceCheckUtils]: 95: Hoare triple {6684#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6674#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,296 INFO L290 TraceCheckUtils]: 94: Hoare triple {6684#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6684#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,297 INFO L290 TraceCheckUtils]: 93: Hoare triple {6684#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6684#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,297 INFO L290 TraceCheckUtils]: 92: Hoare triple {6694#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6684#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,298 INFO L290 TraceCheckUtils]: 91: Hoare triple {6694#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6694#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-14 19:37:44,298 INFO L290 TraceCheckUtils]: 90: Hoare triple {6694#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6694#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-14 19:37:44,299 INFO L290 TraceCheckUtils]: 89: Hoare triple {6704#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6694#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-14 19:37:44,299 INFO L290 TraceCheckUtils]: 88: Hoare triple {6704#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6704#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-14 19:37:44,299 INFO L290 TraceCheckUtils]: 87: Hoare triple {6704#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6704#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-14 19:37:44,300 INFO L290 TraceCheckUtils]: 86: Hoare triple {6714#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6704#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-14 19:37:44,300 INFO L290 TraceCheckUtils]: 85: Hoare triple {6714#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6714#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,301 INFO L290 TraceCheckUtils]: 84: Hoare triple {6714#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6714#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,301 INFO L290 TraceCheckUtils]: 83: Hoare triple {6724#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6714#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {6724#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6724#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-14 19:37:44,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {6724#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6724#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-14 19:37:44,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {6734#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6724#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-14 19:37:44,303 INFO L290 TraceCheckUtils]: 79: Hoare triple {6734#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6734#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,303 INFO L290 TraceCheckUtils]: 78: Hoare triple {6734#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6734#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {6744#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6734#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {6744#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6744#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-14 19:37:44,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {6744#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6744#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-14 19:37:44,305 INFO L290 TraceCheckUtils]: 74: Hoare triple {6754#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6744#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-14 19:37:44,305 INFO L290 TraceCheckUtils]: 73: Hoare triple {6754#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6754#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,306 INFO L290 TraceCheckUtils]: 72: Hoare triple {6754#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6754#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,306 INFO L290 TraceCheckUtils]: 71: Hoare triple {6764#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6754#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {6764#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6764#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,316 INFO L290 TraceCheckUtils]: 69: Hoare triple {6764#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6764#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,317 INFO L290 TraceCheckUtils]: 68: Hoare triple {6774#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6764#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,317 INFO L290 TraceCheckUtils]: 67: Hoare triple {6774#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6774#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-14 19:37:44,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {6774#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6774#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-14 19:37:44,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {6784#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6774#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-14 19:37:44,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {6784#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6784#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-14 19:37:44,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {6784#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6784#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-14 19:37:44,320 INFO L290 TraceCheckUtils]: 62: Hoare triple {6794#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6784#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-14 19:37:44,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {6794#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6794#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {6794#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6794#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {6804#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6794#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {6804#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6804#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6804#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {6814#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6804#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,323 INFO L290 TraceCheckUtils]: 55: Hoare triple {6814#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6814#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-14 19:37:44,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {6814#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6814#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-14 19:37:44,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {6824#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6814#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-14 19:37:44,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {6824#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6824#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-14 19:37:44,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {6824#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6824#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-14 19:37:44,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {6834#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6824#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-14 19:37:44,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {6834#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6834#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {6834#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6834#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {6844#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6834#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {6844#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6844#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {6844#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6844#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {6854#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6844#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {6854#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6854#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {6854#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6854#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {6864#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6854#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {6864#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6864#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {6864#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6864#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {6874#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6864#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {6874#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6874#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {6874#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6874#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {6884#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6874#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {6884#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6884#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {6884#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6884#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {6894#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6884#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {6894#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6894#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {6894#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6894#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {6904#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6894#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {6904#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6904#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-14 19:37:44,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {6904#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6904#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-14 19:37:44,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {6914#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6904#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-14 19:37:44,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {6914#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6914#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-14 19:37:44,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {6914#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6914#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-14 19:37:44,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {6924#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6914#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-14 19:37:44,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {6924#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6924#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {6924#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6924#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {6934#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6924#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {6934#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6934#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {6934#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6934#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {6944#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6934#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {6944#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6944#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-14 19:37:44,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {6944#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6944#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-14 19:37:44,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {6954#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6944#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-14 19:37:44,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {6954#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6954#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {6954#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6954#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {6964#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6954#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-14 19:37:44,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {6964#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6964#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-14 19:37:44,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {6964#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6964#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-14 19:37:44,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {6974#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6964#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-14 19:37:44,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {6974#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6974#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {6974#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6974#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {6005#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {6974#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-14 19:37:44,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {6005#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:44,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6005#true} {6005#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:44,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {6005#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:44,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {6005#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6005#true} is VALID [2022-04-14 19:37:44,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {6005#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6005#true} is VALID [2022-04-14 19:37:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2856 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-14 19:37:44,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806635125] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 19:37:44,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 19:37:44,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 53, 45] total 136 [2022-04-14 19:37:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245795979] [2022-04-14 19:37:44,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 19:37:44,350 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-14 19:37:44,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:37:44,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:44,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:37:44,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-04-14 19:37:44,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:37:44,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-04-14 19:37:44,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=15960, Unknown=0, NotChecked=0, Total=18360 [2022-04-14 19:37:44,663 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:37:58,386 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:38:00,403 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:38:02,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:38:04,579 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:38:06,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:38:09,090 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:38:11,104 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:44:58,976 WARN L232 SmtUtils]: Spent 2.56m on a formula simplification that was a NOOP. DAG size: 193 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 19:45:03,469 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-14 19:45:05,478 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-14 19:45:07,486 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-14 19:45:09,508 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:45:11,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:45:13,536 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:45:17,884 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:45:22,066 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:45:24,082 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-14 19:45:26,100 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false