/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:22:50,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:22:50,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:22:50,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:22:50,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:22:50,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:22:50,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:22:50,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:22:50,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:22:50,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:22:50,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:22:50,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:22:50,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:22:50,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:22:50,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:22:50,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:22:50,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:22:50,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:22:50,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:22:50,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:22:50,866 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:22:50,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:22:50,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:22:50,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:22:50,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:22:50,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:22:50,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:22:50,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:22:50,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:22:50,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:22:50,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:22:50,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:22:50,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:22:50,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:22:50,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:22:50,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:22:50,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:22:50,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:22:50,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:22:50,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:22:50,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:22:50,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:22:50,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:22:50,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:22:50,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:22:50,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:22:50,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:22:50,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:22:50,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:22:50,902 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:22:50,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:22:50,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:22:50,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:22:50,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:22:50,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:22:50,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:22:50,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:22:50,903 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:22:50,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:22:50,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:22:50,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:22:50,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:22:50,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:22:50,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:22:50,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:22:50,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:22:50,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:22:50,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:22:50,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:22:50,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:22:50,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:22:50,905 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:22:50,905 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:22:51,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:22:51,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:22:51,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:22:51,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:22:51,110 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:22:51,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2022-04-27 21:22:51,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7674af03c/3a9fb8129f8f41b3a3a6bea3ac3a2ace/FLAGaffab5a29 [2022-04-27 21:22:51,519 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:22:51,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2022-04-27 21:22:51,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7674af03c/3a9fb8129f8f41b3a3a6bea3ac3a2ace/FLAGaffab5a29 [2022-04-27 21:22:51,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7674af03c/3a9fb8129f8f41b3a3a6bea3ac3a2ace [2022-04-27 21:22:51,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:22:51,546 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:22:51,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:22:51,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:22:51,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:22:51,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1edc72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51, skipping insertion in model container [2022-04-27 21:22:51,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:22:51,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:22:51,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c[322,335] [2022-04-27 21:22:51,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:22:51,755 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:22:51,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c[322,335] [2022-04-27 21:22:51,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:22:51,779 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:22:51,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51 WrapperNode [2022-04-27 21:22:51,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:22:51,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:22:51,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:22:51,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:22:51,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:22:51,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:22:51,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:22:51,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:22:51,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51" (1/1) ... [2022-04-27 21:22:51,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:22:51,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:22:51,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:22:51,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:22:51,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:22:51,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:22:51,883 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:22:51,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:22:51,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:22:51,883 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:22:51,884 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:22:51,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:22:51,935 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:22:51,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:22:52,069 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:22:52,073 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:22:52,074 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:22:52,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:22:52 BoogieIcfgContainer [2022-04-27 21:22:52,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:22:52,075 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:22:52,076 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:22:52,081 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:22:52,099 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:22:52" (1/1) ... [2022-04-27 21:22:52,101 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:22:52,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:22:52 BasicIcfg [2022-04-27 21:22:52,135 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:22:52,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:22:52,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:22:52,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:22:52,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:22:51" (1/4) ... [2022-04-27 21:22:52,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26699fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:22:52, skipping insertion in model container [2022-04-27 21:22:52,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:22:51" (2/4) ... [2022-04-27 21:22:52,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26699fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:22:52, skipping insertion in model container [2022-04-27 21:22:52,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:22:52" (3/4) ... [2022-04-27 21:22:52,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26699fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:22:52, skipping insertion in model container [2022-04-27 21:22:52,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:22:52" (4/4) ... [2022-04-27 21:22:52,142 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-2.cqvasr [2022-04-27 21:22:52,156 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:22:52,156 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:22:52,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:22:52,209 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3639d732, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e5f11af [2022-04-27 21:22:52,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:22:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:22:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:22:52,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:22:52,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:22:52,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:22:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:22:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-04-27 21:22:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:22:52,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249243950] [2022-04-27 21:22:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:22:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:52,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:22:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:52,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {22#true} is VALID [2022-04-27 21:22:52,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:22:52,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:22:52,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:22:52,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {22#true} is VALID [2022-04-27 21:22:52,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:22:52,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:22:52,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:22:52,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {22#true} is VALID [2022-04-27 21:22:52,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [51] L16-2-->L15-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:22:52,400 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {23#false} is VALID [2022-04-27 21:22:52,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23#false} is VALID [2022-04-27 21:22:52,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:22:52,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:22:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:52,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:22:52,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249243950] [2022-04-27 21:22:52,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249243950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:22:52,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:22:52,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:22:52,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938875985] [2022-04-27 21:22:52,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:22:52,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:22:52,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:22:52,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:52,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:22:52,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:22:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:22:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:22:52,449 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:52,517 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-27 21:22:52,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:22:52,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:22:52,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:22:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 21:22:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 21:22:52,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-27 21:22:52,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:52,586 INFO L225 Difference]: With dead ends: 30 [2022-04-27 21:22:52,587 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 21:22:52,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:22:52,594 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:22:52,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:22:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 21:22:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 21:22:52,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:22:52,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,622 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,622 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:52,627 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 21:22:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 21:22:52,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:52,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:52,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 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 13 states. [2022-04-27 21:22:52,630 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 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 13 states. [2022-04-27 21:22:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:52,633 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 21:22:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 21:22:52,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:52,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:52,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:22:52,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:22:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-27 21:22:52,636 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-27 21:22:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:22:52,637 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-27 21:22:52,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 21:22:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:22:52,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:22:52,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:22:52,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:22:52,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:22:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:22:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-04-27 21:22:52,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:22:52,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146968242] [2022-04-27 21:22:52,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:52,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:22:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:22:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:52,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {115#true} is VALID [2022-04-27 21:22:52,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:22:52,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115#true} {115#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:22:52,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {115#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:22:52,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {115#true} is VALID [2022-04-27 21:22:52,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:22:52,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115#true} {115#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:22:52,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {115#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:22:52,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {120#(= main_~x~0 0)} is VALID [2022-04-27 21:22:52,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#(= main_~x~0 0)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-27 21:22:52,756 INFO L272 TraceCheckUtils]: 7: Hoare triple {116#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {116#false} is VALID [2022-04-27 21:22:52,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {116#false} is VALID [2022-04-27 21:22:52,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {116#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-27 21:22:52,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {116#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-27 21:22:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:52,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:22:52,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146968242] [2022-04-27 21:22:52,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146968242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:22:52,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:22:52,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:22:52,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670629750] [2022-04-27 21:22:52,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:22:52,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:22:52,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:22:52,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:52,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:22:52,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:22:52,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:22:52,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:22:52,780 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:52,853 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 21:22:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:22:52,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 21:22:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:22:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 21:22:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 21:22:52,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-27 21:22:52,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:52,889 INFO L225 Difference]: With dead ends: 22 [2022-04-27 21:22:52,889 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 21:22:52,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:22:52,890 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:22:52,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:22:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 21:22:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 21:22:52,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:22:52,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,893 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,893 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:52,894 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:22:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:22:52,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:52,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:52,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 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 15 states. [2022-04-27 21:22:52,895 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 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 15 states. [2022-04-27 21:22:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:52,896 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:22:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:22:52,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:52,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:52,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:22:52,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:22:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 21:22:52,897 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-27 21:22:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:22:52,897 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 21:22:52,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:22:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:22:52,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:22:52,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:22:52,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:22:52,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:22:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:22:52,898 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-04-27 21:22:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:22:52,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998299512] [2022-04-27 21:22:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:52,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:22:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:22:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:52,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {212#true} is VALID [2022-04-27 21:22:52,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:52,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:52,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:22:52,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {212#true} is VALID [2022-04-27 21:22:52,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:52,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:52,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:52,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {217#(= main_~x~0 0)} is VALID [2022-04-27 21:22:52,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {217#(= main_~x~0 0)} is VALID [2022-04-27 21:22:52,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {218#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:22:52,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:22:52,985 INFO L272 TraceCheckUtils]: 9: Hoare triple {213#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {213#false} is VALID [2022-04-27 21:22:52,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {213#false} is VALID [2022-04-27 21:22:52,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:22:52,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:22:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:52,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:22:52,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998299512] [2022-04-27 21:22:52,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998299512] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:22:52,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610266004] [2022-04-27 21:22:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:52,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:52,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:22:52,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:22:53,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:22:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:53,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:22:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:53,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:22:53,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:53,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} [47] 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) 13) (= (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] {212#true} is VALID [2022-04-27 21:22:53,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:53,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:53,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:53,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {217#(= main_~x~0 0)} is VALID [2022-04-27 21:22:53,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {217#(= main_~x~0 0)} is VALID [2022-04-27 21:22:53,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {244#(= main_~x~0 1)} is VALID [2022-04-27 21:22:53,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(= main_~x~0 1)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:22:53,132 INFO L272 TraceCheckUtils]: 9: Hoare triple {213#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {213#false} is VALID [2022-04-27 21:22:53,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {213#false} is VALID [2022-04-27 21:22:53,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:22:53,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:22:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:53,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:22:53,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:22:53,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:22:53,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {213#false} is VALID [2022-04-27 21:22:53,216 INFO L272 TraceCheckUtils]: 9: Hoare triple {213#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {213#false} is VALID [2022-04-27 21:22:53,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {272#(< (mod main_~x~0 4294967296) 268435455)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:22:53,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {272#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 21:22:53,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {276#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 21:22:53,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {276#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 21:22:53,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:53,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:53,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:53,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} [47] 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) 13) (= (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] {212#true} is VALID [2022-04-27 21:22:53,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:22:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:53,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610266004] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:22:53,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:22:53,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 21:22:53,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264818051] [2022-04-27 21:22:53,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:22:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 13 [2022-04-27 21:22:53,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:22:53,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:53,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:53,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:22:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:22:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:22:53,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:22:53,240 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:53,394 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-27 21:22:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:22:53,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 13 [2022-04-27 21:22:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:22:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 21:22:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 21:22:53,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-27 21:22:53,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:53,439 INFO L225 Difference]: With dead ends: 26 [2022-04-27 21:22:53,439 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 21:22:53,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:22:53,443 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:22:53,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:22:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 21:22:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 21:22:53,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:22:53,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:53,451 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:53,453 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:53,455 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 21:22:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 21:22:53,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:53,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:53,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 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 19 states. [2022-04-27 21:22:53,457 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 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 19 states. [2022-04-27 21:22:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:53,458 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 21:22:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 21:22:53,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:53,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:53,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:22:53,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:22:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 21:22:53,460 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-27 21:22:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:22:53,460 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 21:22:53,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 21:22:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:22:53,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:22:53,461 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:22:53,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:22:53,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:53,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:22:53,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:22:53,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-04-27 21:22:53,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:22:53,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060337745] [2022-04-27 21:22:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:53,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:22:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:22:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:53,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {413#true} is VALID [2022-04-27 21:22:53,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:53,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {413#true} {413#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:53,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:22:53,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {413#true} is VALID [2022-04-27 21:22:53,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:53,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:53,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:53,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {418#(= main_~x~0 0)} is VALID [2022-04-27 21:22:53,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {418#(= main_~x~0 0)} is VALID [2022-04-27 21:22:53,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:53,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:53,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {420#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:53,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {420#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:53,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {414#false} is VALID [2022-04-27 21:22:53,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {414#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:22:53,775 INFO L272 TraceCheckUtils]: 13: Hoare triple {414#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {414#false} is VALID [2022-04-27 21:22:53,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {414#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {414#false} is VALID [2022-04-27 21:22:53,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {414#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:22:53,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:22:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:22:53,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060337745] [2022-04-27 21:22:53,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060337745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:22:53,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211037190] [2022-04-27 21:22:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:53,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:53,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:22:53,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:22:53,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:22:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:53,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 21:22:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:53,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:22:54,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:54,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [47] 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) 13) (= (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] {413#true} is VALID [2022-04-27 21:22:54,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:54,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:54,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:54,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {418#(= main_~x~0 0)} is VALID [2022-04-27 21:22:54,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {418#(= main_~x~0 0)} is VALID [2022-04-27 21:22:54,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:54,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:54,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {452#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:54,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {452#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {452#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:54,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {452#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {459#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:54,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {459#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:54,042 INFO L272 TraceCheckUtils]: 13: Hoare triple {459#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:22:54,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#(<= 1 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:22:54,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {470#(<= 1 __VERIFIER_assert_~cond)} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:22:54,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:22:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:54,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:22:54,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:22:54,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {470#(<= 1 __VERIFIER_assert_~cond)} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:22:54,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#(<= 1 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:22:54,157 INFO L272 TraceCheckUtils]: 13: Hoare triple {486#(= (mod main_~x~0 2) 0)} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:22:54,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {486#(= (mod main_~x~0 2) 0)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:22:54,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {486#(= (mod main_~x~0 2) 0)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:22:54,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {486#(= (mod main_~x~0 2) 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:22:54,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {499#(= (mod (+ main_~x~0 1) 2) 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:22:54,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {499#(= (mod (+ main_~x~0 1) 2) 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {499#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-27 21:22:54,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#(= (mod main_~x~0 2) 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {499#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-27 21:22:54,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(= (mod main_~x~0 2) 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:22:54,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:22:54,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:54,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:54,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:54,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [47] 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) 13) (= (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] {413#true} is VALID [2022-04-27 21:22:54,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:22:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 21:22:54,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211037190] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:22:54,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:22:54,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-04-27 21:22:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057627126] [2022-04-27 21:22:54,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:22:54,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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 17 [2022-04-27 21:22:54,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:22:54,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:54,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:54,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 21:22:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:22:54,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 21:22:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:22:54,202 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:54,498 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 21:22:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:22:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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 17 [2022-04-27 21:22:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:22:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-27 21:22:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-27 21:22:54,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2022-04-27 21:22:54,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:54,537 INFO L225 Difference]: With dead ends: 34 [2022-04-27 21:22:54,537 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 21:22:54,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-27 21:22:54,538 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:22:54,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:22:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 21:22:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-27 21:22:54,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:22:54,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:54,547 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:54,547 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:54,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:54,548 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 21:22:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 21:22:54,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:54,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:54,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 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 23 states. [2022-04-27 21:22:54,548 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 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 23 states. [2022-04-27 21:22:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:54,549 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 21:22:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 21:22:54,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:54,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:54,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:22:54,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:22:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-27 21:22:54,550 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-27 21:22:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:22:54,550 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-27 21:22:54,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 21:22:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 21:22:54,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:22:54,556 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:22:54,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 21:22:54,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:22:54,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:22:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:22:54,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1560917373, now seen corresponding path program 2 times [2022-04-27 21:22:54,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:22:54,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643658839] [2022-04-27 21:22:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:54,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:22:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:22:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:54,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {676#true} is VALID [2022-04-27 21:22:54,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:54,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {676#true} {676#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:54,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {676#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:22:54,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {676#true} is VALID [2022-04-27 21:22:54,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {676#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:54,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:54,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {676#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:54,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {681#(= main_~x~0 0)} is VALID [2022-04-27 21:22:54,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {681#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {681#(= main_~x~0 0)} is VALID [2022-04-27 21:22:54,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {681#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:54,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:54,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:54,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:54,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {684#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 21:22:54,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {684#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {684#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 21:22:54,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {684#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {677#false} is VALID [2022-04-27 21:22:54,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:22:54,863 INFO L272 TraceCheckUtils]: 15: Hoare triple {677#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {677#false} is VALID [2022-04-27 21:22:54,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {677#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {677#false} is VALID [2022-04-27 21:22:54,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {677#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:22:54,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {677#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:22:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:54,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:22:54,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643658839] [2022-04-27 21:22:54,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643658839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:22:54,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507686290] [2022-04-27 21:22:54,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:22:54,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:54,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:22:54,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:22:54,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 21:22:54,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:22:54,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:22:54,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 21:22:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:54,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:22:55,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {676#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:55,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#true} [47] 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) 13) (= (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] {676#true} is VALID [2022-04-27 21:22:55,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {676#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:55,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:55,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {676#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:55,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {681#(= main_~x~0 0)} is VALID [2022-04-27 21:22:55,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {681#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {681#(= main_~x~0 0)} is VALID [2022-04-27 21:22:55,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {681#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:55,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:55,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:55,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:55,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {722#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:55,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {722#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {722#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:55,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {722#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {677#false} is VALID [2022-04-27 21:22:55,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:22:55,155 INFO L272 TraceCheckUtils]: 15: Hoare triple {677#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {677#false} is VALID [2022-04-27 21:22:55,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {677#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {677#false} is VALID [2022-04-27 21:22:55,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {677#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:22:55,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {677#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:22:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:55,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:22:55,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {677#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:22:55,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {677#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:22:55,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {677#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {677#false} is VALID [2022-04-27 21:22:55,350 INFO L272 TraceCheckUtils]: 15: Hoare triple {677#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {677#false} is VALID [2022-04-27 21:22:55,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:22:55,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {759#(< (mod main_~x~0 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {677#false} is VALID [2022-04-27 21:22:55,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {763#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {759#(< (mod main_~x~0 4294967296) 65521)} is VALID [2022-04-27 21:22:55,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {767#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {763#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} is VALID [2022-04-27 21:22:55,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {767#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {767#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} is VALID [2022-04-27 21:22:55,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {767#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} is VALID [2022-04-27 21:22:55,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {774#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-27 21:22:55,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {774#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-27 21:22:55,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {781#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} is VALID [2022-04-27 21:22:55,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {781#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} is VALID [2022-04-27 21:22:55,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {676#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:55,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:55,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {676#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:55,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#true} [47] 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) 13) (= (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] {676#true} is VALID [2022-04-27 21:22:55,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {676#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:22:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:55,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507686290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:22:55,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:22:55,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-04-27 21:22:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321133653] [2022-04-27 21:22:55,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:22:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 19 [2022-04-27 21:22:55,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:22:55,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:55,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:55,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 21:22:55,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:22:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 21:22:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:22:55,388 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:55,893 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 21:22:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 21:22:55,893 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 19 [2022-04-27 21:22:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:22:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-27 21:22:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-27 21:22:55,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-27 21:22:55,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:55,937 INFO L225 Difference]: With dead ends: 42 [2022-04-27 21:22:55,937 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 21:22:55,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2022-04-27 21:22:55,938 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:22:55,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 39 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:22:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 21:22:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 21:22:55,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:22:55,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:55,962 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:55,962 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:55,963 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 21:22:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 21:22:55,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:55,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:55,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 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 32 states. [2022-04-27 21:22:55,964 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 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 32 states. [2022-04-27 21:22:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:55,965 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 21:22:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 21:22:55,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:55,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:55,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:22:55,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:22:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-27 21:22:55,967 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 19 [2022-04-27 21:22:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:22:55,967 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-27 21:22:55,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 21:22:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 21:22:55,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:22:55,968 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:22:55,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 21:22:56,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:56,177 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:22:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:22:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash 838082225, now seen corresponding path program 3 times [2022-04-27 21:22:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:22:56,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499838091] [2022-04-27 21:22:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:22:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:22:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:56,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {1000#true} is VALID [2022-04-27 21:22:56,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1000#true} {1000#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {1000#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:22:56,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {1000#true} is VALID [2022-04-27 21:22:56,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {1000#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1005#(= main_~x~0 0)} is VALID [2022-04-27 21:22:56,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {1005#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1005#(= main_~x~0 0)} is VALID [2022-04-27 21:22:56,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {1005#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:56,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {1006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:56,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:56,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {1007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:56,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {1007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:56,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {1008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:56,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {1008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:56,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {1009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:56,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {1009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:22:56,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:22:56,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {1010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:22:56,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:22:56,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:22:56,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {1012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:22:56,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {1012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:22:56,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {1013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:22:56,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {1013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1014#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:22:56,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {1014#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1014#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:22:56,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {1014#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1001#false} is VALID [2022-04-27 21:22:56,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {1001#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:22:56,393 INFO L272 TraceCheckUtils]: 27: Hoare triple {1001#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1001#false} is VALID [2022-04-27 21:22:56,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {1001#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1001#false} is VALID [2022-04-27 21:22:56,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {1001#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:22:56,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {1001#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:22:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:56,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:22:56,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499838091] [2022-04-27 21:22:56,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499838091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:22:56,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713231646] [2022-04-27 21:22:56,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 21:22:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:22:56,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:22:56,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 21:22:56,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 21:22:56,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:22:56,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 21:22:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:56,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:22:56,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {1000#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} [47] 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) 13) (= (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] {1000#true} is VALID [2022-04-27 21:22:56,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {1000#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1000#true} is VALID [2022-04-27 21:22:56,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1088#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-27 21:22:56,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {1088#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1088#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-27 21:22:56,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {1088#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1095#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-27 21:22:56,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {1095#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:22:56,722 INFO L272 TraceCheckUtils]: 27: Hoare triple {1001#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1001#false} is VALID [2022-04-27 21:22:56,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {1001#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1001#false} is VALID [2022-04-27 21:22:56,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {1001#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:22:56,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {1001#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:22:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-27 21:22:56,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:22:56,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {1001#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:22:56,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {1001#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:22:56,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {1001#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1001#false} is VALID [2022-04-27 21:22:56,964 INFO L272 TraceCheckUtils]: 27: Hoare triple {1001#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1001#false} is VALID [2022-04-27 21:22:56,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {1123#(< (mod main_~x~0 4294967296) 268435455)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:22:56,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {1127#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1123#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 21:22:56,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {1127#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1127#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 21:22:56,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1127#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 21:22:56,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:22:56,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1000#true} is VALID [2022-04-27 21:22:56,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {1000#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} [47] 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) 13) (= (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] {1000#true} is VALID [2022-04-27 21:22:56,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {1000#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:22:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-27 21:22:56,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713231646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:22:56,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:22:56,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 17 [2022-04-27 21:22:56,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659667827] [2022-04-27 21:22:56,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:22:56,988 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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 31 [2022-04-27 21:22:56,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:22:56,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:57,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:57,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 21:22:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:22:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 21:22:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-04-27 21:22:57,022 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:57,738 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-27 21:22:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 21:22:57,738 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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 31 [2022-04-27 21:22:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:22:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-27 21:22:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-27 21:22:57,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 60 transitions. [2022-04-27 21:22:57,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:57,850 INFO L225 Difference]: With dead ends: 63 [2022-04-27 21:22:57,850 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 21:22:57,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2022-04-27 21:22:57,851 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:22:57,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 43 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:22:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 21:22:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2022-04-27 21:22:57,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:22:57,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:57,890 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:57,891 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:57,892 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-27 21:22:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-27 21:22:57,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:57,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:57,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 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 53 states. [2022-04-27 21:22:57,893 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 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 53 states. [2022-04-27 21:22:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:57,894 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-27 21:22:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-27 21:22:57,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:57,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:57,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:22:57,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:22:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 21:22:57,896 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 31 [2022-04-27 21:22:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:22:57,896 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 21:22:57,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 21:22:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 21:22:57,897 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:22:57,897 INFO L195 NwaCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:22:57,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 21:22:58,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:58,114 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:22:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:22:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash 890325540, now seen corresponding path program 4 times [2022-04-27 21:22:58,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:22:58,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629277680] [2022-04-27 21:22:58,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:22:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:22:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:58,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {1504#true} is VALID [2022-04-27 21:22:58,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:58,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1504#true} {1504#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:58,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:22:58,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {1504#true} is VALID [2022-04-27 21:22:58,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:58,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:58,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:58,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1509#(= main_~x~0 0)} is VALID [2022-04-27 21:22:58,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {1509#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1509#(= main_~x~0 0)} is VALID [2022-04-27 21:22:58,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:58,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:58,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:58,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:58,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:58,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:58,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:58,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:58,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:22:58,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:22:58,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:22:58,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:22:58,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:22:58,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:22:58,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:22:58,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:22:58,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:22:58,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:22:58,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:22:58,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:22:58,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1520#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:22:58,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {1520#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1520#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:22:58,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {1520#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1505#false} is VALID [2022-04-27 21:22:58,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {1505#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:58,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {1505#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1505#false} is VALID [2022-04-27 21:22:58,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {1505#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:58,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {1505#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1505#false} is VALID [2022-04-27 21:22:58,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {1505#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:58,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {1505#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1505#false} is VALID [2022-04-27 21:22:58,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:58,381 INFO L272 TraceCheckUtils]: 37: Hoare triple {1505#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1505#false} is VALID [2022-04-27 21:22:58,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {1505#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1505#false} is VALID [2022-04-27 21:22:58,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {1505#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:58,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {1505#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 21:22:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:22:58,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629277680] [2022-04-27 21:22:58,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629277680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:22:58,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300101705] [2022-04-27 21:22:58,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 21:22:58,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:58,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:22:58,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:22:58,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 21:22:58,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 21:22:58,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:22:58,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 21:22:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:58,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:22:58,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:58,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} [47] 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) 13) (= (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] {1504#true} is VALID [2022-04-27 21:22:58,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:58,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:58,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:58,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1509#(= main_~x~0 0)} is VALID [2022-04-27 21:22:58,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {1509#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1509#(= main_~x~0 0)} is VALID [2022-04-27 21:22:58,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:58,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:58,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:58,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:58,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:58,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:58,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:58,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:58,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:22:58,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:22:58,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:22:58,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:22:58,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:22:58,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:22:58,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:22:58,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:22:58,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:22:58,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:22:58,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:22:58,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:22:58,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1606#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:22:58,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {1606#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1606#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:22:58,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {1606#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1613#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:22:58,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {1613#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1613#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:22:58,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {1613#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1620#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:22:58,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {1620#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1620#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:22:58,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {1620#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1627#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:22:58,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {1627#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1627#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:22:58,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {1627#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1634#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:22:58,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {1634#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:58,894 INFO L272 TraceCheckUtils]: 37: Hoare triple {1505#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1505#false} is VALID [2022-04-27 21:22:58,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {1505#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1505#false} is VALID [2022-04-27 21:22:58,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {1505#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:58,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {1505#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:58,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:22:59,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {1505#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:59,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {1505#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:59,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {1505#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1505#false} is VALID [2022-04-27 21:22:59,432 INFO L272 TraceCheckUtils]: 37: Hoare triple {1505#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1505#false} is VALID [2022-04-27 21:22:59,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {1662#(< (mod main_~x~0 4294967296) 268435455)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:22:59,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {1666#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1662#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {1666#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1666#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {1673#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1666#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {1673#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1673#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {1680#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1673#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {1680#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1680#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {1687#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1680#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {1687#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1687#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {1694#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1687#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {1694#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1694#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {1701#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1694#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {1701#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1701#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {1708#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1701#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {1708#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1708#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {1715#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1708#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1715#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1715#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {1722#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1715#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {1722#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1722#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1722#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {1729#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1729#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {1736#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1729#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {1736#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1736#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {1743#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1736#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {1743#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1743#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {1750#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1743#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1750#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1750#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {1757#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1750#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {1757#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1757#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {1764#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1757#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {1764#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1764#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1764#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 21:22:59,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:59,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:59,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:59,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} [47] 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) 13) (= (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] {1504#true} is VALID [2022-04-27 21:22:59,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:22:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:22:59,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300101705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:22:59,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:22:59,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 36 [2022-04-27 21:22:59,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480623689] [2022-04-27 21:22:59,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:22:59,455 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 21:22:59,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:22:59,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:59,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:59,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 21:22:59,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:22:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 21:22:59,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=907, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 21:22:59,532 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:10,425 INFO L93 Difference]: Finished difference Result 93 states and 126 transitions. [2022-04-27 21:23:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 21:23:10,425 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 21:23:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:23:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-27 21:23:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-27 21:23:10,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 82 transitions. [2022-04-27 21:23:10,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:10,628 INFO L225 Difference]: With dead ends: 93 [2022-04-27 21:23:10,629 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 21:23:10,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=876, Invalid=2430, Unknown=0, NotChecked=0, Total=3306 [2022-04-27 21:23:10,631 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 21:23:10,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 93 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 21:23:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 21:23:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2022-04-27 21:23:10,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:23:10,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:10,696 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:10,696 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:10,698 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-27 21:23:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-27 21:23:10,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:10,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:10,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 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 77 states. [2022-04-27 21:23:10,699 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 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 77 states. [2022-04-27 21:23:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:10,700 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-27 21:23:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-27 21:23:10,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:10,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:10,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:23:10,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:23:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-04-27 21:23:10,702 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 41 [2022-04-27 21:23:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:23:10,702 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-04-27 21:23:10,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 21:23:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-27 21:23:10,703 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:23:10,703 INFO L195 NwaCegarLoop]: trace histogram [23, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:23:10,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 21:23:10,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:23:10,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:23:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:23:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash -422126962, now seen corresponding path program 5 times [2022-04-27 21:23:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:23:10,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542818846] [2022-04-27 21:23:10,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:23:10,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:23:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:11,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:23:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:11,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {2234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2215#true} is VALID [2022-04-27 21:23:11,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:11,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2215#true} {2215#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:11,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:23:11,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2215#true} is VALID [2022-04-27 21:23:11,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:11,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:11,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:11,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2220#(= main_~x~0 0)} is VALID [2022-04-27 21:23:11,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {2220#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2220#(= main_~x~0 0)} is VALID [2022-04-27 21:23:11,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {2220#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:23:11,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:23:11,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:23:11,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:23:11,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:23:11,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:23:11,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:23:11,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:23:11,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:23:11,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:23:11,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:23:11,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:23:11,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:23:11,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:23:11,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:23:11,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:23:11,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:23:11,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:23:11,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:23:11,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:23:11,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:23:11,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:23:11,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:23:11,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:23:11,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2233#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:23:11,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {2233#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2233#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:23:11,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {2233#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 39: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {2216#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L272 TraceCheckUtils]: 53: Hoare triple {2216#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,260 INFO L290 TraceCheckUtils]: 56: Hoare triple {2216#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 266 proven. 182 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-27 21:23:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:23:11,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542818846] [2022-04-27 21:23:11,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542818846] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:23:11,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243746445] [2022-04-27 21:23:11,261 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 21:23:11,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:23:11,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:23:11,262 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:23:11,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 21:23:12,166 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-27 21:23:12,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:23:12,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-27 21:23:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:12,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:23:12,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:12,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} [47] 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2215#true} is VALID [2022-04-27 21:23:12,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:12,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:12,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:12,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2220#(= main_~x~0 0)} is VALID [2022-04-27 21:23:12,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {2220#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2220#(= main_~x~0 0)} is VALID [2022-04-27 21:23:12,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {2220#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:23:12,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:23:12,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:23:12,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:23:12,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:23:12,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:23:12,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:23:12,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:23:12,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:23:12,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:23:12,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:23:12,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:23:12,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:23:12,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:23:12,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:23:12,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:23:12,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:23:12,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:23:12,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:23:12,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:23:12,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:23:12,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:23:12,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:23:12,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:23:12,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:23:12,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {2331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:23:12,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {2331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2338#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:23:12,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {2338#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2338#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:23:12,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {2338#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2345#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:23:12,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {2345#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2345#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:23:12,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {2345#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2352#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:23:12,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {2352#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2352#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:23:12,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {2352#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2359#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:23:12,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2359#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:23:12,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {2359#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:12,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:12,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:12,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {2216#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L272 TraceCheckUtils]: 53: Hoare triple {2216#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:12,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {2216#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 21:23:12,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:23:13,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {2216#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L272 TraceCheckUtils]: 53: Hoare triple {2216#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {2216#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:13,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:13,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:13,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:13,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:13,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:23:13,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {2456#(< (mod main_~x~0 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:23:13,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {2460#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2456#(< (mod main_~x~0 4294967296) 65521)} is VALID [2022-04-27 21:23:13,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {2464#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2460#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} is VALID [2022-04-27 21:23:13,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {2464#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2464#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {2471#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2464#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {2471#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2471#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {2478#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2471#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {2478#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2478#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {2485#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2478#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {2485#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2485#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2485#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {2492#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2492#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {2499#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2492#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {2499#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2499#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {2506#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2499#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {2506#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2506#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {2513#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2506#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {2513#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2513#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {2520#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2513#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {2520#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2520#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {2527#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2520#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {2527#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2527#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {2534#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2527#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {2534#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2534#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {2541#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2534#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {2541#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2541#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2541#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {2548#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2548#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {2555#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2548#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {2555#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2555#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {2562#(or (< (mod (+ 19 main_~x~0) 4294967296) 65521) (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2555#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {2562#(or (< (mod (+ 19 main_~x~0) 4294967296) 65521) (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2562#(or (< (mod (+ 19 main_~x~0) 4294967296) 65521) (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {2569#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2562#(or (< (mod (+ 19 main_~x~0) 4294967296) 65521) (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {2569#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2569#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {2576#(or (< (mod (+ main_~x~0 21) 4294967296) 65521) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2569#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} is VALID [2022-04-27 21:23:13,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {2576#(or (< (mod (+ main_~x~0 21) 4294967296) 65521) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2576#(or (< (mod (+ main_~x~0 21) 4294967296) 65521) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2576#(or (< (mod (+ main_~x~0 21) 4294967296) 65521) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} is VALID [2022-04-27 21:23:13,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:13,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:13,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:13,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} [47] 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2215#true} is VALID [2022-04-27 21:23:13,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:23:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 21:23:13,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243746445] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:23:13,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:23:13,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 21] total 41 [2022-04-27 21:23:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320873882] [2022-04-27 21:23:13,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:23:13,854 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 57 [2022-04-27 21:23:13,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:23:13,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:13,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-27 21:23:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:23:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-27 21:23:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1185, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 21:23:13,951 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:58,609 WARN L232 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 135 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:23:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:58,732 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2022-04-27 21:23:58,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-27 21:23:58,733 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 57 [2022-04-27 21:23:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:23:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 106 transitions. [2022-04-27 21:23:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 106 transitions. [2022-04-27 21:23:58,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 106 transitions. [2022-04-27 21:23:58,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:58,860 INFO L225 Difference]: With dead ends: 126 [2022-04-27 21:23:58,860 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 21:23:58,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=1475, Invalid=3927, Unknown=0, NotChecked=0, Total=5402 [2022-04-27 21:23:58,862 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 21:23:58,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 109 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 21:23:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 21:23:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-27 21:23:59,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:23:59,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:59,031 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:59,031 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:59,033 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2022-04-27 21:23:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-04-27 21:23:59,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:59,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:59,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 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 98 states. [2022-04-27 21:23:59,034 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 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 98 states. [2022-04-27 21:23:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:59,035 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2022-04-27 21:23:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-04-27 21:23:59,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:59,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:59,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:23:59,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:23:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-04-27 21:23:59,039 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 57 [2022-04-27 21:23:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:23:59,039 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-04-27 21:23:59,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-04-27 21:23:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 21:23:59,040 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:23:59,040 INFO L195 NwaCegarLoop]: trace histogram [43, 33, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:23:59,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 21:23:59,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:23:59,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:23:59,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:23:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash 505554918, now seen corresponding path program 6 times [2022-04-27 21:23:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:23:59,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746449879] [2022-04-27 21:23:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:23:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:23:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:00,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:24:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:00,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {3239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {3200#true} is VALID [2022-04-27 21:24:00,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {3200#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:00,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3200#true} {3200#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:00,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {3200#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:24:00,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {3239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {3200#true} is VALID [2022-04-27 21:24:00,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {3200#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:00,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3200#true} {3200#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:00,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {3200#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:00,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {3200#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3205#(= main_~x~0 0)} is VALID [2022-04-27 21:24:00,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {3205#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3205#(= main_~x~0 0)} is VALID [2022-04-27 21:24:00,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {3205#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3206#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:24:00,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {3206#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3206#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:24:00,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {3206#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3207#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:24:00,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {3207#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3207#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:24:00,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {3207#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3208#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:24:00,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {3208#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3208#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:24:00,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {3208#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3209#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:24:00,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {3209#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3209#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:24:00,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {3209#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3210#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:24:00,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {3210#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3210#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:24:00,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {3210#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3211#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:24:00,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {3211#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3211#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:24:00,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {3211#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3212#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:24:00,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {3212#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3212#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:24:00,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {3212#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3213#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:24:00,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {3213#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3213#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:24:00,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {3213#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3214#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:24:00,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {3214#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3214#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:24:00,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {3214#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3215#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:24:00,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {3215#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3215#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:24:00,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {3215#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3216#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:24:00,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {3216#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3216#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:24:00,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {3216#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3217#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:24:00,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {3217#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3217#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:24:00,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {3217#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3218#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:24:00,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {3218#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3218#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:24:00,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {3218#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3219#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:24:00,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {3219#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3219#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:24:00,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {3219#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3220#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:24:00,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {3220#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3220#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:24:00,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {3220#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3221#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:24:00,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {3221#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3221#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:24:00,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {3221#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3222#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:24:00,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {3222#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3222#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:24:00,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {3222#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3223#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:24:00,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {3223#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3223#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:24:00,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {3223#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3224#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:24:00,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {3224#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3224#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:24:00,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {3224#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:24:00,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {3225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:24:00,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {3225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3226#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:24:00,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {3226#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3226#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:24:00,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {3226#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3227#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:24:00,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {3227#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3227#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:24:00,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {3227#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:24:00,081 INFO L290 TraceCheckUtils]: 52: Hoare triple {3228#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:24:00,082 INFO L290 TraceCheckUtils]: 53: Hoare triple {3228#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3229#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:24:00,082 INFO L290 TraceCheckUtils]: 54: Hoare triple {3229#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:24:00,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {3229#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3230#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:24:00,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {3230#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3230#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:24:00,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {3230#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3231#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:24:00,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {3231#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3231#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:24:00,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {3231#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3232#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:24:00,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {3232#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3232#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:24:00,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {3232#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3233#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:24:00,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {3233#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3233#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:24:00,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {3233#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3234#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:24:00,087 INFO L290 TraceCheckUtils]: 64: Hoare triple {3234#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3234#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:24:00,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {3234#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3235#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:24:00,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {3235#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3235#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:24:00,089 INFO L290 TraceCheckUtils]: 67: Hoare triple {3235#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3236#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:24:00,089 INFO L290 TraceCheckUtils]: 68: Hoare triple {3236#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3236#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:24:00,090 INFO L290 TraceCheckUtils]: 69: Hoare triple {3236#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:24:00,090 INFO L290 TraceCheckUtils]: 70: Hoare triple {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:24:00,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {3237#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3238#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:24:00,091 INFO L290 TraceCheckUtils]: 72: Hoare triple {3238#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3238#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:24:00,091 INFO L290 TraceCheckUtils]: 73: Hoare triple {3238#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 74: Hoare triple {3201#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 75: Hoare triple {3201#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 76: Hoare triple {3201#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 77: Hoare triple {3201#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 78: Hoare triple {3201#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 79: Hoare triple {3201#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 80: Hoare triple {3201#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 81: Hoare triple {3201#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 82: Hoare triple {3201#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 83: Hoare triple {3201#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 84: Hoare triple {3201#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 85: Hoare triple {3201#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 86: Hoare triple {3201#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,092 INFO L290 TraceCheckUtils]: 87: Hoare triple {3201#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,093 INFO L290 TraceCheckUtils]: 88: Hoare triple {3201#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,093 INFO L290 TraceCheckUtils]: 89: Hoare triple {3201#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,093 INFO L290 TraceCheckUtils]: 90: Hoare triple {3201#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,093 INFO L290 TraceCheckUtils]: 91: Hoare triple {3201#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,093 INFO L290 TraceCheckUtils]: 92: Hoare triple {3201#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,093 INFO L272 TraceCheckUtils]: 93: Hoare triple {3201#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3201#false} is VALID [2022-04-27 21:24:00,093 INFO L290 TraceCheckUtils]: 94: Hoare triple {3201#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3201#false} is VALID [2022-04-27 21:24:00,093 INFO L290 TraceCheckUtils]: 95: Hoare triple {3201#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,093 INFO L290 TraceCheckUtils]: 96: Hoare triple {3201#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 646 proven. 1122 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-27 21:24:00,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:24:00,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746449879] [2022-04-27 21:24:00,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746449879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:24:00,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068884211] [2022-04-27 21:24:00,095 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 21:24:00,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:24:00,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:24:00,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:24:00,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 21:24:02,962 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2022-04-27 21:24:02,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:24:02,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 21:24:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:24:02,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:24:03,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {3200#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {3200#true} [47] 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) 13) (= (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] {3200#true} is VALID [2022-04-27 21:24:03,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {3200#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3200#true} {3200#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {3200#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {3200#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3200#true} is VALID [2022-04-27 21:24:03,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 39: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 42: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 43: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 47: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 50: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 51: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 52: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 54: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,669 INFO L290 TraceCheckUtils]: 65: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,669 INFO L290 TraceCheckUtils]: 67: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:03,669 INFO L290 TraceCheckUtils]: 70: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:03,670 INFO L290 TraceCheckUtils]: 71: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3456#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {3456#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3456#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {3456#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3463#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {3463#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3463#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {3463#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3470#(< (mod (+ 4294967291 main_~x~0) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {3470#(< (mod (+ 4294967291 main_~x~0) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3470#(< (mod (+ 4294967291 main_~x~0) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,673 INFO L290 TraceCheckUtils]: 77: Hoare triple {3470#(< (mod (+ 4294967291 main_~x~0) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3477#(< (mod (+ main_~x~0 4294967289) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,673 INFO L290 TraceCheckUtils]: 78: Hoare triple {3477#(< (mod (+ main_~x~0 4294967289) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3477#(< (mod (+ main_~x~0 4294967289) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,675 INFO L290 TraceCheckUtils]: 79: Hoare triple {3477#(< (mod (+ main_~x~0 4294967289) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3484#(< (mod (+ main_~x~0 4294967287) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,675 INFO L290 TraceCheckUtils]: 80: Hoare triple {3484#(< (mod (+ main_~x~0 4294967287) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3484#(< (mod (+ main_~x~0 4294967287) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,676 INFO L290 TraceCheckUtils]: 81: Hoare triple {3484#(< (mod (+ main_~x~0 4294967287) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3491#(< (mod (+ main_~x~0 4294967285) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,676 INFO L290 TraceCheckUtils]: 82: Hoare triple {3491#(< (mod (+ main_~x~0 4294967285) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3491#(< (mod (+ main_~x~0 4294967285) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,681 INFO L290 TraceCheckUtils]: 83: Hoare triple {3491#(< (mod (+ main_~x~0 4294967285) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3498#(< (mod (+ 4294967283 main_~x~0) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,681 INFO L290 TraceCheckUtils]: 84: Hoare triple {3498#(< (mod (+ 4294967283 main_~x~0) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3498#(< (mod (+ 4294967283 main_~x~0) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,682 INFO L290 TraceCheckUtils]: 85: Hoare triple {3498#(< (mod (+ 4294967283 main_~x~0) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3505#(< (mod (+ main_~x~0 4294967281) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,682 INFO L290 TraceCheckUtils]: 86: Hoare triple {3505#(< (mod (+ main_~x~0 4294967281) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3505#(< (mod (+ main_~x~0 4294967281) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,683 INFO L290 TraceCheckUtils]: 87: Hoare triple {3505#(< (mod (+ main_~x~0 4294967281) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3512#(< (mod (+ main_~x~0 4294967279) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {3512#(< (mod (+ main_~x~0 4294967279) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3512#(< (mod (+ main_~x~0 4294967279) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,684 INFO L290 TraceCheckUtils]: 89: Hoare triple {3512#(< (mod (+ main_~x~0 4294967279) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3519#(< (mod (+ main_~x~0 4294967277) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,684 INFO L290 TraceCheckUtils]: 90: Hoare triple {3519#(< (mod (+ main_~x~0 4294967277) 4294967296) 65521)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3519#(< (mod (+ main_~x~0 4294967277) 4294967296) 65521)} is VALID [2022-04-27 21:24:03,688 INFO L290 TraceCheckUtils]: 91: Hoare triple {3519#(< (mod (+ main_~x~0 4294967277) 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3526#(and (< (mod (+ 4294967275 main_~x~0) 4294967296) 65521) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)))} is VALID [2022-04-27 21:24:03,690 INFO L290 TraceCheckUtils]: 92: Hoare triple {3526#(and (< (mod (+ 4294967275 main_~x~0) 4294967296) 65521) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:03,690 INFO L272 TraceCheckUtils]: 93: Hoare triple {3201#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3201#false} is VALID [2022-04-27 21:24:03,690 INFO L290 TraceCheckUtils]: 94: Hoare triple {3201#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3201#false} is VALID [2022-04-27 21:24:03,690 INFO L290 TraceCheckUtils]: 95: Hoare triple {3201#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:03,691 INFO L290 TraceCheckUtils]: 96: Hoare triple {3201#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 693 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-04-27 21:24:03,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:24:06,370 INFO L290 TraceCheckUtils]: 96: Hoare triple {3201#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:06,371 INFO L290 TraceCheckUtils]: 95: Hoare triple {3545#(not (<= __VERIFIER_assert_~cond 0))} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3201#false} is VALID [2022-04-27 21:24:06,371 INFO L290 TraceCheckUtils]: 94: Hoare triple {3549#(< 0 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3545#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:24:06,372 INFO L272 TraceCheckUtils]: 93: Hoare triple {3553#(= (mod main_~x~0 2) 0)} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3549#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:24:06,372 INFO L290 TraceCheckUtils]: 92: Hoare triple {3557#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3553#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:24:06,373 INFO L290 TraceCheckUtils]: 91: Hoare triple {3561#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3557#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,374 INFO L290 TraceCheckUtils]: 90: Hoare triple {3565#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3561#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {3569#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3565#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,375 INFO L290 TraceCheckUtils]: 88: Hoare triple {3569#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3569#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,377 INFO L290 TraceCheckUtils]: 87: Hoare triple {3576#(or (< (mod (+ main_~x~0 6) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3569#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,377 INFO L290 TraceCheckUtils]: 86: Hoare triple {3576#(or (< (mod (+ main_~x~0 6) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3576#(or (< (mod (+ main_~x~0 6) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,378 INFO L290 TraceCheckUtils]: 85: Hoare triple {3583#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3576#(or (< (mod (+ main_~x~0 6) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,379 INFO L290 TraceCheckUtils]: 84: Hoare triple {3583#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3583#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,380 INFO L290 TraceCheckUtils]: 83: Hoare triple {3590#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3583#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,380 INFO L290 TraceCheckUtils]: 82: Hoare triple {3590#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3590#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,381 INFO L290 TraceCheckUtils]: 81: Hoare triple {3597#(or (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3590#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,382 INFO L290 TraceCheckUtils]: 80: Hoare triple {3597#(or (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3597#(or (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,383 INFO L290 TraceCheckUtils]: 79: Hoare triple {3604#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3597#(or (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {3604#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3604#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {3611#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3604#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,385 INFO L290 TraceCheckUtils]: 76: Hoare triple {3611#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3611#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-27 21:24:06,386 INFO L290 TraceCheckUtils]: 75: Hoare triple {3618#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3611#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-27 21:24:06,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {3618#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3618#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {3625#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3618#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {3625#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3625#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 71: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3625#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 70: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 68: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {3200#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {3200#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {3200#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3200#true} is VALID [2022-04-27 21:24:06,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {3200#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3200#true} {3200#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {3200#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {3200#true} [47] 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) 13) (= (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] {3200#true} is VALID [2022-04-27 21:24:06,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {3200#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3200#true} is VALID [2022-04-27 21:24:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 693 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-04-27 21:24:06,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068884211] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:24:06,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:24:06,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13, 17] total 63 [2022-04-27 21:24:06,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472471314] [2022-04-27 21:24:06,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:24:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-27 21:24:06,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:24:06,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:24:06,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:24:06,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-27 21:24:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:24:06,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-27 21:24:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=2950, Unknown=0, NotChecked=0, Total=3906 [2022-04-27 21:24:06,630 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:27,567 WARN L232 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:25:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:25:27,659 INFO L93 Difference]: Finished difference Result 204 states and 275 transitions. [2022-04-27 21:25:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-27 21:25:27,660 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-27 21:25:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:25:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 174 transitions. [2022-04-27 21:25:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 174 transitions. [2022-04-27 21:25:27,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 174 transitions. [2022-04-27 21:25:30,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 173 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 21:25:30,038 INFO L225 Difference]: With dead ends: 204 [2022-04-27 21:25:30,038 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 21:25:30,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 77.1s TimeCoverageRelationStatistics Valid=2929, Invalid=12323, Unknown=0, NotChecked=0, Total=15252 [2022-04-27 21:25:30,042 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 242 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-27 21:25:30,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 81 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-27 21:25:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 21:25:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2022-04-27 21:25:30,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:25:30,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 148 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 143 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:30,307 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 148 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 143 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:30,308 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 148 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 143 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:25:30,311 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2022-04-27 21:25:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2022-04-27 21:25:30,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:25:30,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:25:30,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 143 states have internal predecessors, (158), 3 states have call successors, (3), 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 173 states. [2022-04-27 21:25:30,312 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 143 states have internal predecessors, (158), 3 states have call successors, (3), 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 173 states. [2022-04-27 21:25:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:25:30,315 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2022-04-27 21:25:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2022-04-27 21:25:30,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:25:30,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:25:30,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:25:30,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:25:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 143 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-04-27 21:25:30,318 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 97 [2022-04-27 21:25:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:25:30,318 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-04-27 21:25:30,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-04-27 21:25:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-27 21:25:30,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:25:30,319 INFO L195 NwaCegarLoop]: trace histogram [57, 35, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:25:30,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 21:25:30,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:25:30,525 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:25:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:25:30,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1282419970, now seen corresponding path program 7 times [2022-04-27 21:25:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:25:30,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114672823] [2022-04-27 21:25:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:25:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:25:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:25:31,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:25:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:25:31,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {4908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {4867#true} is VALID [2022-04-27 21:25:31,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {4867#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:31,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4867#true} {4867#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:31,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {4867#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:25:31,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {4908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 13) (= (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] {4867#true} is VALID [2022-04-27 21:25:31,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {4867#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:31,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4867#true} {4867#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:31,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {4867#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:31,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {4867#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {4872#(= main_~x~0 0)} is VALID [2022-04-27 21:25:31,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {4872#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4872#(= main_~x~0 0)} is VALID [2022-04-27 21:25:31,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {4872#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4873#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:25:31,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {4873#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4873#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:25:31,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {4873#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4874#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:25:31,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {4874#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4874#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:25:31,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {4874#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4875#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:25:31,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {4875#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4875#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:25:31,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {4875#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4876#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:25:31,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {4876#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4876#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:25:31,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {4876#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4877#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:25:31,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {4877#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4877#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:25:31,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {4877#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4878#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:25:31,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {4878#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4878#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:25:31,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {4878#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4879#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:25:31,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {4879#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4879#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:25:31,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {4879#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4880#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:25:31,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {4880#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4880#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:25:31,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {4880#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4881#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:25:31,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {4881#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4881#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:25:31,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {4881#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4882#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:25:31,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {4882#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4882#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:25:31,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {4882#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4883#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:25:31,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {4883#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4883#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:25:31,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {4883#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:25:31,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {4884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:25:31,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {4884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4885#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:25:31,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {4885#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4885#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:25:31,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {4885#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4886#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:25:31,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4886#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:25:31,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4887#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:25:31,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {4887#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4887#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:25:31,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {4887#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:25:31,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {4888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:25:31,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {4888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4889#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:25:31,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {4889#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4889#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:25:31,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {4889#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4890#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:25:31,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {4890#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4890#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:25:31,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {4890#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4891#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:25:31,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {4891#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4891#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:25:31,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {4891#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4892#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:25:31,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {4892#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4892#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:25:31,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {4892#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4893#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:25:31,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {4893#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4893#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:25:31,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {4893#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4894#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:25:31,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {4894#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4894#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:25:31,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {4894#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4895#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:25:31,371 INFO L290 TraceCheckUtils]: 52: Hoare triple {4895#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4895#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:25:31,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {4895#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4896#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:25:31,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {4896#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4896#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:25:31,372 INFO L290 TraceCheckUtils]: 55: Hoare triple {4896#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4897#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:25:31,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {4897#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4897#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:25:31,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {4897#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4898#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:25:31,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {4898#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4898#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:25:31,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {4898#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4899#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:25:31,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {4899#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4899#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:25:31,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {4899#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4900#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:25:31,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {4900#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4900#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:25:31,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {4900#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4901#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:25:31,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {4901#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4901#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:25:31,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {4901#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4902#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:25:31,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {4902#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4902#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:25:31,377 INFO L290 TraceCheckUtils]: 67: Hoare triple {4902#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4903#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:25:31,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {4903#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4903#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:25:31,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {4903#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4904#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:25:31,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {4904#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4904#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:25:31,378 INFO L290 TraceCheckUtils]: 71: Hoare triple {4904#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4905#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 21:25:31,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {4905#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4905#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 21:25:31,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {4905#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4906#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 21:25:31,379 INFO L290 TraceCheckUtils]: 74: Hoare triple {4906#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4906#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 21:25:31,380 INFO L290 TraceCheckUtils]: 75: Hoare triple {4906#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4907#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:25:31,380 INFO L290 TraceCheckUtils]: 76: Hoare triple {4907#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4907#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:25:31,386 INFO L290 TraceCheckUtils]: 77: Hoare triple {4907#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,386 INFO L290 TraceCheckUtils]: 78: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 79: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 81: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 82: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 83: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 84: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 85: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 86: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 87: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 88: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 90: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 91: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 93: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 94: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 95: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 96: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 97: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 99: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 100: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 103: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 104: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 105: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 106: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 107: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,388 INFO L290 TraceCheckUtils]: 108: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 109: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 110: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 111: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 112: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 113: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 114: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 115: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 116: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 117: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 118: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 119: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 120: Hoare triple {4868#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L272 TraceCheckUtils]: 121: Hoare triple {4868#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 122: Hoare triple {4868#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4868#false} is VALID [2022-04-27 21:25:31,389 INFO L290 TraceCheckUtils]: 123: Hoare triple {4868#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,390 INFO L290 TraceCheckUtils]: 124: Hoare triple {4868#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1548 proven. 1260 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-27 21:25:31,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:25:31,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114672823] [2022-04-27 21:25:31,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114672823] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:25:31,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955317068] [2022-04-27 21:25:31,391 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 21:25:31,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:25:31,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:25:31,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:25:31,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 21:25:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:25:31,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 114 conjunts are in the unsatisfiable core [2022-04-27 21:25:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:25:31,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:25:33,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {4867#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:33,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {4867#true} [47] 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) 13) (= (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] {4867#true} is VALID [2022-04-27 21:25:33,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {4867#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:33,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4867#true} {4867#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:33,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {4867#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:33,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {4867#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {4872#(= main_~x~0 0)} is VALID [2022-04-27 21:25:33,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {4872#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4872#(= main_~x~0 0)} is VALID [2022-04-27 21:25:33,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {4872#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4873#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:25:33,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {4873#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4873#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:25:33,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {4873#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4874#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:25:33,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {4874#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4874#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:25:33,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {4874#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4875#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:25:33,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {4875#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4875#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:25:33,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {4875#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4876#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:25:33,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {4876#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4876#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:25:33,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {4876#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4877#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:25:33,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {4877#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4877#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:25:33,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {4877#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4878#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:25:33,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {4878#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4878#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:25:33,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {4878#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4879#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:25:33,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {4879#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4879#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:25:33,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {4879#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4880#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:25:33,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {4880#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4880#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:25:33,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {4880#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4881#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:25:33,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {4881#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4881#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:25:33,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {4881#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4882#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:25:33,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {4882#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4882#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:25:33,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {4882#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4883#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:25:33,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {4883#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4883#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:25:33,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {4883#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:25:33,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {4884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:25:33,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {4884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4885#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:25:33,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {4885#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4885#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:25:33,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {4885#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4886#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:25:33,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4886#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:25:33,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4887#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:25:33,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {4887#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4887#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:25:33,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {4887#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:25:33,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {4888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:25:33,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {4888#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4889#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:25:33,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {4889#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4889#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:25:33,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {4889#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4890#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:25:33,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {4890#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4890#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:25:33,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {4890#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4891#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:25:33,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {4891#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4891#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:25:33,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {4891#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4892#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:25:33,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {4892#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4892#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:25:33,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {4892#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4893#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:25:33,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {4893#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4893#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:25:33,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {4893#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4894#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:25:33,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {4894#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4894#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:25:33,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {4894#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4895#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:25:33,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {4895#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4895#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:25:33,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {4895#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4896#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:25:33,221 INFO L290 TraceCheckUtils]: 54: Hoare triple {4896#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4896#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:25:33,221 INFO L290 TraceCheckUtils]: 55: Hoare triple {4896#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4897#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:25:33,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {4897#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4897#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:25:33,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {4897#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4898#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:25:33,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {4898#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4898#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:25:33,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {4898#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4899#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:25:33,223 INFO L290 TraceCheckUtils]: 60: Hoare triple {4899#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4899#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:25:33,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {4899#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4900#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:25:33,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {4900#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4900#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:25:33,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {4900#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4901#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:25:33,225 INFO L290 TraceCheckUtils]: 64: Hoare triple {4901#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4901#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:25:33,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {4901#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4902#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:25:33,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {4902#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4902#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:25:33,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {4902#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4903#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:25:33,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {4903#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4903#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:25:33,232 INFO L290 TraceCheckUtils]: 69: Hoare triple {4903#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4904#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:25:33,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {4904#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4904#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:25:33,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {4904#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4905#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 21:25:33,234 INFO L290 TraceCheckUtils]: 72: Hoare triple {4905#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4905#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 21:25:33,238 INFO L290 TraceCheckUtils]: 73: Hoare triple {4905#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4906#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 21:25:33,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {4906#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4906#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 21:25:33,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {4906#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5137#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 21:25:33,240 INFO L290 TraceCheckUtils]: 76: Hoare triple {5137#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5137#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 21:25:33,240 INFO L290 TraceCheckUtils]: 77: Hoare triple {5137#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5144#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 21:25:33,241 INFO L290 TraceCheckUtils]: 78: Hoare triple {5144#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5144#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 21:25:33,241 INFO L290 TraceCheckUtils]: 79: Hoare triple {5144#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5151#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 21:25:33,241 INFO L290 TraceCheckUtils]: 80: Hoare triple {5151#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5151#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 21:25:33,242 INFO L290 TraceCheckUtils]: 81: Hoare triple {5151#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5158#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-27 21:25:33,242 INFO L290 TraceCheckUtils]: 82: Hoare triple {5158#(and (<= main_~x~0 41) (<= 41 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5158#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-27 21:25:33,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {5158#(and (<= main_~x~0 41) (<= 41 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5165#(and (<= main_~x~0 43) (<= 43 main_~x~0))} is VALID [2022-04-27 21:25:33,243 INFO L290 TraceCheckUtils]: 84: Hoare triple {5165#(and (<= main_~x~0 43) (<= 43 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5165#(and (<= main_~x~0 43) (<= 43 main_~x~0))} is VALID [2022-04-27 21:25:33,243 INFO L290 TraceCheckUtils]: 85: Hoare triple {5165#(and (<= main_~x~0 43) (<= 43 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5172#(and (<= main_~x~0 45) (<= 45 main_~x~0))} is VALID [2022-04-27 21:25:33,244 INFO L290 TraceCheckUtils]: 86: Hoare triple {5172#(and (<= main_~x~0 45) (<= 45 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5172#(and (<= main_~x~0 45) (<= 45 main_~x~0))} is VALID [2022-04-27 21:25:33,244 INFO L290 TraceCheckUtils]: 87: Hoare triple {5172#(and (<= main_~x~0 45) (<= 45 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5179#(and (<= 47 main_~x~0) (<= main_~x~0 47))} is VALID [2022-04-27 21:25:33,245 INFO L290 TraceCheckUtils]: 88: Hoare triple {5179#(and (<= 47 main_~x~0) (<= main_~x~0 47))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5179#(and (<= 47 main_~x~0) (<= main_~x~0 47))} is VALID [2022-04-27 21:25:33,245 INFO L290 TraceCheckUtils]: 89: Hoare triple {5179#(and (<= 47 main_~x~0) (<= main_~x~0 47))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5186#(and (<= main_~x~0 49) (<= 49 main_~x~0))} is VALID [2022-04-27 21:25:33,245 INFO L290 TraceCheckUtils]: 90: Hoare triple {5186#(and (<= main_~x~0 49) (<= 49 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5186#(and (<= main_~x~0 49) (<= 49 main_~x~0))} is VALID [2022-04-27 21:25:33,246 INFO L290 TraceCheckUtils]: 91: Hoare triple {5186#(and (<= main_~x~0 49) (<= 49 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5193#(and (<= main_~x~0 51) (<= 51 main_~x~0))} is VALID [2022-04-27 21:25:33,246 INFO L290 TraceCheckUtils]: 92: Hoare triple {5193#(and (<= main_~x~0 51) (<= 51 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5193#(and (<= main_~x~0 51) (<= 51 main_~x~0))} is VALID [2022-04-27 21:25:33,247 INFO L290 TraceCheckUtils]: 93: Hoare triple {5193#(and (<= main_~x~0 51) (<= 51 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5200#(and (<= 53 main_~x~0) (<= main_~x~0 53))} is VALID [2022-04-27 21:25:33,247 INFO L290 TraceCheckUtils]: 94: Hoare triple {5200#(and (<= 53 main_~x~0) (<= main_~x~0 53))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5200#(and (<= 53 main_~x~0) (<= main_~x~0 53))} is VALID [2022-04-27 21:25:33,247 INFO L290 TraceCheckUtils]: 95: Hoare triple {5200#(and (<= 53 main_~x~0) (<= main_~x~0 53))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5207#(and (<= main_~x~0 55) (<= 55 main_~x~0))} is VALID [2022-04-27 21:25:33,248 INFO L290 TraceCheckUtils]: 96: Hoare triple {5207#(and (<= main_~x~0 55) (<= 55 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5207#(and (<= main_~x~0 55) (<= 55 main_~x~0))} is VALID [2022-04-27 21:25:33,248 INFO L290 TraceCheckUtils]: 97: Hoare triple {5207#(and (<= main_~x~0 55) (<= 55 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5214#(and (<= 57 main_~x~0) (<= main_~x~0 57))} is VALID [2022-04-27 21:25:33,249 INFO L290 TraceCheckUtils]: 98: Hoare triple {5214#(and (<= 57 main_~x~0) (<= main_~x~0 57))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5214#(and (<= 57 main_~x~0) (<= main_~x~0 57))} is VALID [2022-04-27 21:25:33,249 INFO L290 TraceCheckUtils]: 99: Hoare triple {5214#(and (<= 57 main_~x~0) (<= main_~x~0 57))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5221#(and (<= main_~x~0 59) (<= 59 main_~x~0))} is VALID [2022-04-27 21:25:33,249 INFO L290 TraceCheckUtils]: 100: Hoare triple {5221#(and (<= main_~x~0 59) (<= 59 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5221#(and (<= main_~x~0 59) (<= 59 main_~x~0))} is VALID [2022-04-27 21:25:33,250 INFO L290 TraceCheckUtils]: 101: Hoare triple {5221#(and (<= main_~x~0 59) (<= 59 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5228#(and (<= main_~x~0 61) (<= 61 main_~x~0))} is VALID [2022-04-27 21:25:33,250 INFO L290 TraceCheckUtils]: 102: Hoare triple {5228#(and (<= main_~x~0 61) (<= 61 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5228#(and (<= main_~x~0 61) (<= 61 main_~x~0))} is VALID [2022-04-27 21:25:33,251 INFO L290 TraceCheckUtils]: 103: Hoare triple {5228#(and (<= main_~x~0 61) (<= 61 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5235#(and (<= main_~x~0 63) (<= 63 main_~x~0))} is VALID [2022-04-27 21:25:33,251 INFO L290 TraceCheckUtils]: 104: Hoare triple {5235#(and (<= main_~x~0 63) (<= 63 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5235#(and (<= main_~x~0 63) (<= 63 main_~x~0))} is VALID [2022-04-27 21:25:33,251 INFO L290 TraceCheckUtils]: 105: Hoare triple {5235#(and (<= main_~x~0 63) (<= 63 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5242#(and (<= 65 main_~x~0) (<= main_~x~0 65))} is VALID [2022-04-27 21:25:33,252 INFO L290 TraceCheckUtils]: 106: Hoare triple {5242#(and (<= 65 main_~x~0) (<= main_~x~0 65))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5242#(and (<= 65 main_~x~0) (<= main_~x~0 65))} is VALID [2022-04-27 21:25:33,252 INFO L290 TraceCheckUtils]: 107: Hoare triple {5242#(and (<= 65 main_~x~0) (<= main_~x~0 65))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5249#(and (<= 67 main_~x~0) (<= main_~x~0 67))} is VALID [2022-04-27 21:25:33,252 INFO L290 TraceCheckUtils]: 108: Hoare triple {5249#(and (<= 67 main_~x~0) (<= main_~x~0 67))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5249#(and (<= 67 main_~x~0) (<= main_~x~0 67))} is VALID [2022-04-27 21:25:33,253 INFO L290 TraceCheckUtils]: 109: Hoare triple {5249#(and (<= 67 main_~x~0) (<= main_~x~0 67))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5256#(and (<= main_~x~0 69) (<= 69 main_~x~0))} is VALID [2022-04-27 21:25:33,253 INFO L290 TraceCheckUtils]: 110: Hoare triple {5256#(and (<= main_~x~0 69) (<= 69 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5256#(and (<= main_~x~0 69) (<= 69 main_~x~0))} is VALID [2022-04-27 21:25:33,254 INFO L290 TraceCheckUtils]: 111: Hoare triple {5256#(and (<= main_~x~0 69) (<= 69 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5263#(and (<= 71 main_~x~0) (<= main_~x~0 71))} is VALID [2022-04-27 21:25:33,254 INFO L290 TraceCheckUtils]: 112: Hoare triple {5263#(and (<= 71 main_~x~0) (<= main_~x~0 71))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5263#(and (<= 71 main_~x~0) (<= main_~x~0 71))} is VALID [2022-04-27 21:25:33,255 INFO L290 TraceCheckUtils]: 113: Hoare triple {5263#(and (<= 71 main_~x~0) (<= main_~x~0 71))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5270#(and (<= main_~x~0 73) (<= 73 main_~x~0))} is VALID [2022-04-27 21:25:33,255 INFO L290 TraceCheckUtils]: 114: Hoare triple {5270#(and (<= main_~x~0 73) (<= 73 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5270#(and (<= main_~x~0 73) (<= 73 main_~x~0))} is VALID [2022-04-27 21:25:33,255 INFO L290 TraceCheckUtils]: 115: Hoare triple {5270#(and (<= main_~x~0 73) (<= 73 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5277#(and (<= 75 main_~x~0) (<= main_~x~0 75))} is VALID [2022-04-27 21:25:33,256 INFO L290 TraceCheckUtils]: 116: Hoare triple {5277#(and (<= 75 main_~x~0) (<= main_~x~0 75))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5277#(and (<= 75 main_~x~0) (<= main_~x~0 75))} is VALID [2022-04-27 21:25:33,256 INFO L290 TraceCheckUtils]: 117: Hoare triple {5277#(and (<= 75 main_~x~0) (<= main_~x~0 75))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:33,256 INFO L290 TraceCheckUtils]: 118: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:33,256 INFO L290 TraceCheckUtils]: 119: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:33,256 INFO L290 TraceCheckUtils]: 120: Hoare triple {4868#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:33,256 INFO L272 TraceCheckUtils]: 121: Hoare triple {4868#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {4868#false} is VALID [2022-04-27 21:25:33,256 INFO L290 TraceCheckUtils]: 122: Hoare triple {4868#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4868#false} is VALID [2022-04-27 21:25:33,257 INFO L290 TraceCheckUtils]: 123: Hoare triple {4868#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:33,257 INFO L290 TraceCheckUtils]: 124: Hoare triple {4868#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 168 proven. 3080 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:25:33,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:25:39,997 INFO L290 TraceCheckUtils]: 124: Hoare triple {4868#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:39,998 INFO L290 TraceCheckUtils]: 123: Hoare triple {4868#false} [59] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:39,998 INFO L290 TraceCheckUtils]: 122: Hoare triple {4868#false} [58] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4868#false} is VALID [2022-04-27 21:25:39,998 INFO L272 TraceCheckUtils]: 121: Hoare triple {4868#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {4868#false} is VALID [2022-04-27 21:25:39,998 INFO L290 TraceCheckUtils]: 120: Hoare triple {4868#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:39,998 INFO L290 TraceCheckUtils]: 119: Hoare triple {4868#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:39,998 INFO L290 TraceCheckUtils]: 118: Hoare triple {4868#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4868#false} is VALID [2022-04-27 21:25:39,998 INFO L290 TraceCheckUtils]: 117: Hoare triple {5326#(< (mod main_~x~0 4294967296) 65521)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4868#false} is VALID [2022-04-27 21:25:39,999 INFO L290 TraceCheckUtils]: 116: Hoare triple {5330#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5326#(< (mod main_~x~0 4294967296) 65521)} is VALID [2022-04-27 21:25:39,999 INFO L290 TraceCheckUtils]: 115: Hoare triple {5334#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5330#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} is VALID [2022-04-27 21:25:40,000 INFO L290 TraceCheckUtils]: 114: Hoare triple {5334#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5334#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,001 INFO L290 TraceCheckUtils]: 113: Hoare triple {5341#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5334#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,001 INFO L290 TraceCheckUtils]: 112: Hoare triple {5341#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5341#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,002 INFO L290 TraceCheckUtils]: 111: Hoare triple {5348#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5341#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,002 INFO L290 TraceCheckUtils]: 110: Hoare triple {5348#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5348#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,003 INFO L290 TraceCheckUtils]: 109: Hoare triple {5355#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5348#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,003 INFO L290 TraceCheckUtils]: 108: Hoare triple {5355#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5355#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,004 INFO L290 TraceCheckUtils]: 107: Hoare triple {5362#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5355#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,004 INFO L290 TraceCheckUtils]: 106: Hoare triple {5362#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5362#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,006 INFO L290 TraceCheckUtils]: 105: Hoare triple {5369#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5362#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,007 INFO L290 TraceCheckUtils]: 104: Hoare triple {5369#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5369#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,008 INFO L290 TraceCheckUtils]: 103: Hoare triple {5376#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5369#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,008 INFO L290 TraceCheckUtils]: 102: Hoare triple {5376#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5376#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,009 INFO L290 TraceCheckUtils]: 101: Hoare triple {5383#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5376#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,009 INFO L290 TraceCheckUtils]: 100: Hoare triple {5383#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5383#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,010 INFO L290 TraceCheckUtils]: 99: Hoare triple {5390#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5383#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,010 INFO L290 TraceCheckUtils]: 98: Hoare triple {5390#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5390#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,011 INFO L290 TraceCheckUtils]: 97: Hoare triple {5397#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5390#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,011 INFO L290 TraceCheckUtils]: 96: Hoare triple {5397#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5397#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,012 INFO L290 TraceCheckUtils]: 95: Hoare triple {5404#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5397#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,012 INFO L290 TraceCheckUtils]: 94: Hoare triple {5404#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5404#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,013 INFO L290 TraceCheckUtils]: 93: Hoare triple {5411#(or (< (mod (+ main_~x~0 24) 4294967296) 65521) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5404#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,013 INFO L290 TraceCheckUtils]: 92: Hoare triple {5411#(or (< (mod (+ main_~x~0 24) 4294967296) 65521) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5411#(or (< (mod (+ main_~x~0 24) 4294967296) 65521) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,014 INFO L290 TraceCheckUtils]: 91: Hoare triple {5418#(or (< (mod (+ main_~x~0 26) 4294967296) 65521) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5411#(or (< (mod (+ main_~x~0 24) 4294967296) 65521) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,014 INFO L290 TraceCheckUtils]: 90: Hoare triple {5418#(or (< (mod (+ main_~x~0 26) 4294967296) 65521) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5418#(or (< (mod (+ main_~x~0 26) 4294967296) 65521) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,015 INFO L290 TraceCheckUtils]: 89: Hoare triple {5425#(or (< (mod (+ main_~x~0 28) 4294967296) 65521) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5418#(or (< (mod (+ main_~x~0 26) 4294967296) 65521) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,015 INFO L290 TraceCheckUtils]: 88: Hoare triple {5425#(or (< (mod (+ main_~x~0 28) 4294967296) 65521) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5425#(or (< (mod (+ main_~x~0 28) 4294967296) 65521) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,017 INFO L290 TraceCheckUtils]: 87: Hoare triple {5432#(or (< (mod (+ 30 main_~x~0) 4294967296) 65521) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5425#(or (< (mod (+ main_~x~0 28) 4294967296) 65521) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,017 INFO L290 TraceCheckUtils]: 86: Hoare triple {5432#(or (< (mod (+ 30 main_~x~0) 4294967296) 65521) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5432#(or (< (mod (+ 30 main_~x~0) 4294967296) 65521) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,018 INFO L290 TraceCheckUtils]: 85: Hoare triple {5439#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5432#(or (< (mod (+ 30 main_~x~0) 4294967296) 65521) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,018 INFO L290 TraceCheckUtils]: 84: Hoare triple {5439#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5439#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,019 INFO L290 TraceCheckUtils]: 83: Hoare triple {5446#(or (< (mod (+ main_~x~0 34) 4294967296) 65521) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5439#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,019 INFO L290 TraceCheckUtils]: 82: Hoare triple {5446#(or (< (mod (+ main_~x~0 34) 4294967296) 65521) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5446#(or (< (mod (+ main_~x~0 34) 4294967296) 65521) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,020 INFO L290 TraceCheckUtils]: 81: Hoare triple {5453#(or (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (< (mod (+ main_~x~0 36) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5446#(or (< (mod (+ main_~x~0 34) 4294967296) 65521) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,020 INFO L290 TraceCheckUtils]: 80: Hoare triple {5453#(or (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (< (mod (+ main_~x~0 36) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5453#(or (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (< (mod (+ main_~x~0 36) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,021 INFO L290 TraceCheckUtils]: 79: Hoare triple {5460#(or (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (< (mod (+ main_~x~0 38) 4294967296) 65521))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5453#(or (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (< (mod (+ main_~x~0 36) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,021 INFO L290 TraceCheckUtils]: 78: Hoare triple {5460#(or (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (< (mod (+ main_~x~0 38) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5460#(or (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (< (mod (+ main_~x~0 38) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,022 INFO L290 TraceCheckUtils]: 77: Hoare triple {5467#(or (< (mod (+ 40 main_~x~0) 4294967296) 65521) (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65521))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {5460#(or (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (< (mod (+ main_~x~0 38) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {5467#(or (< (mod (+ 40 main_~x~0) 4294967296) 65521) (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5467#(or (< (mod (+ 40 main_~x~0) 4294967296) 65521) (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,023 INFO L290 TraceCheckUtils]: 75: Hoare triple {5474#(or (not (< (mod (+ 41 main_~x~0) 4294967296) 268435455)) (< (mod (+ 41 main_~x~0) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5467#(or (< (mod (+ 40 main_~x~0) 4294967296) 65521) (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,024 INFO L290 TraceCheckUtils]: 74: Hoare triple {5474#(or (not (< (mod (+ 41 main_~x~0) 4294967296) 268435455)) (< (mod (+ 41 main_~x~0) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5474#(or (not (< (mod (+ 41 main_~x~0) 4294967296) 268435455)) (< (mod (+ 41 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,024 INFO L290 TraceCheckUtils]: 73: Hoare triple {5481#(or (< (mod (+ 42 main_~x~0) 4294967296) 65521) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5474#(or (not (< (mod (+ 41 main_~x~0) 4294967296) 268435455)) (< (mod (+ 41 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,025 INFO L290 TraceCheckUtils]: 72: Hoare triple {5481#(or (< (mod (+ 42 main_~x~0) 4294967296) 65521) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5481#(or (< (mod (+ 42 main_~x~0) 4294967296) 65521) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,025 INFO L290 TraceCheckUtils]: 71: Hoare triple {5488#(or (< (mod (+ main_~x~0 43) 4294967296) 65521) (not (< (mod (+ main_~x~0 43) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5481#(or (< (mod (+ 42 main_~x~0) 4294967296) 65521) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,026 INFO L290 TraceCheckUtils]: 70: Hoare triple {5488#(or (< (mod (+ main_~x~0 43) 4294967296) 65521) (not (< (mod (+ main_~x~0 43) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5488#(or (< (mod (+ main_~x~0 43) 4294967296) 65521) (not (< (mod (+ main_~x~0 43) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,026 INFO L290 TraceCheckUtils]: 69: Hoare triple {5495#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (< (mod (+ 44 main_~x~0) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5488#(or (< (mod (+ main_~x~0 43) 4294967296) 65521) (not (< (mod (+ main_~x~0 43) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,027 INFO L290 TraceCheckUtils]: 68: Hoare triple {5495#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (< (mod (+ 44 main_~x~0) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5495#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (< (mod (+ 44 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,027 INFO L290 TraceCheckUtils]: 67: Hoare triple {5502#(or (not (< (mod (+ main_~x~0 45) 4294967296) 268435455)) (< (mod (+ main_~x~0 45) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5495#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (< (mod (+ 44 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {5502#(or (not (< (mod (+ main_~x~0 45) 4294967296) 268435455)) (< (mod (+ main_~x~0 45) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5502#(or (not (< (mod (+ main_~x~0 45) 4294967296) 268435455)) (< (mod (+ main_~x~0 45) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {5509#(or (< (mod (+ main_~x~0 46) 4294967296) 65521) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5502#(or (not (< (mod (+ main_~x~0 45) 4294967296) 268435455)) (< (mod (+ main_~x~0 45) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,029 INFO L290 TraceCheckUtils]: 64: Hoare triple {5509#(or (< (mod (+ main_~x~0 46) 4294967296) 65521) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5509#(or (< (mod (+ main_~x~0 46) 4294967296) 65521) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,029 INFO L290 TraceCheckUtils]: 63: Hoare triple {5516#(or (< (mod (+ main_~x~0 47) 4294967296) 65521) (not (< (mod (+ main_~x~0 47) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5509#(or (< (mod (+ main_~x~0 46) 4294967296) 65521) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {5516#(or (< (mod (+ main_~x~0 47) 4294967296) 65521) (not (< (mod (+ main_~x~0 47) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5516#(or (< (mod (+ main_~x~0 47) 4294967296) 65521) (not (< (mod (+ main_~x~0 47) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,030 INFO L290 TraceCheckUtils]: 61: Hoare triple {5523#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (< (mod (+ main_~x~0 48) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5516#(or (< (mod (+ main_~x~0 47) 4294967296) 65521) (not (< (mod (+ main_~x~0 47) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {5523#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (< (mod (+ main_~x~0 48) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5523#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (< (mod (+ main_~x~0 48) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {5530#(or (< (mod (+ 49 main_~x~0) 4294967296) 65521) (not (< (mod (+ 49 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5523#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (< (mod (+ main_~x~0 48) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {5530#(or (< (mod (+ 49 main_~x~0) 4294967296) 65521) (not (< (mod (+ 49 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5530#(or (< (mod (+ 49 main_~x~0) 4294967296) 65521) (not (< (mod (+ 49 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {5537#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (< (mod (+ main_~x~0 50) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5530#(or (< (mod (+ 49 main_~x~0) 4294967296) 65521) (not (< (mod (+ 49 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {5537#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (< (mod (+ main_~x~0 50) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5537#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (< (mod (+ main_~x~0 50) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,033 INFO L290 TraceCheckUtils]: 55: Hoare triple {5544#(or (< (mod (+ 51 main_~x~0) 4294967296) 65521) (not (< (mod (+ 51 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5537#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (< (mod (+ main_~x~0 50) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {5544#(or (< (mod (+ 51 main_~x~0) 4294967296) 65521) (not (< (mod (+ 51 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5544#(or (< (mod (+ 51 main_~x~0) 4294967296) 65521) (not (< (mod (+ 51 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {5551#(or (< (mod (+ main_~x~0 52) 4294967296) 65521) (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5544#(or (< (mod (+ 51 main_~x~0) 4294967296) 65521) (not (< (mod (+ 51 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {5551#(or (< (mod (+ main_~x~0 52) 4294967296) 65521) (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5551#(or (< (mod (+ main_~x~0 52) 4294967296) 65521) (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {5558#(or (< (mod (+ 53 main_~x~0) 4294967296) 65521) (not (< (mod (+ 53 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5551#(or (< (mod (+ main_~x~0 52) 4294967296) 65521) (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {5558#(or (< (mod (+ 53 main_~x~0) 4294967296) 65521) (not (< (mod (+ 53 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5558#(or (< (mod (+ 53 main_~x~0) 4294967296) 65521) (not (< (mod (+ 53 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {5565#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 54) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5558#(or (< (mod (+ 53 main_~x~0) 4294967296) 65521) (not (< (mod (+ 53 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {5565#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 54) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5565#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 54) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {5572#(or (not (< (mod (+ main_~x~0 55) 4294967296) 268435455)) (< (mod (+ main_~x~0 55) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5565#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 54) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {5572#(or (not (< (mod (+ main_~x~0 55) 4294967296) 268435455)) (< (mod (+ main_~x~0 55) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5572#(or (not (< (mod (+ main_~x~0 55) 4294967296) 268435455)) (< (mod (+ main_~x~0 55) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {5579#(or (< (mod (+ 56 main_~x~0) 4294967296) 65521) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5572#(or (not (< (mod (+ main_~x~0 55) 4294967296) 268435455)) (< (mod (+ main_~x~0 55) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {5579#(or (< (mod (+ 56 main_~x~0) 4294967296) 65521) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5579#(or (< (mod (+ 56 main_~x~0) 4294967296) 65521) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {5586#(or (< (mod (+ 57 main_~x~0) 4294967296) 65521) (not (< (mod (+ 57 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5579#(or (< (mod (+ 56 main_~x~0) 4294967296) 65521) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {5586#(or (< (mod (+ 57 main_~x~0) 4294967296) 65521) (not (< (mod (+ 57 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5586#(or (< (mod (+ 57 main_~x~0) 4294967296) 65521) (not (< (mod (+ 57 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {5593#(or (< (mod (+ main_~x~0 58) 4294967296) 65521) (not (< (mod (+ main_~x~0 58) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5586#(or (< (mod (+ 57 main_~x~0) 4294967296) 65521) (not (< (mod (+ 57 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {5593#(or (< (mod (+ main_~x~0 58) 4294967296) 65521) (not (< (mod (+ main_~x~0 58) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5593#(or (< (mod (+ main_~x~0 58) 4294967296) 65521) (not (< (mod (+ main_~x~0 58) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {5600#(or (< (mod (+ 59 main_~x~0) 4294967296) 65521) (not (< (mod (+ 59 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5593#(or (< (mod (+ main_~x~0 58) 4294967296) 65521) (not (< (mod (+ main_~x~0 58) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {5600#(or (< (mod (+ 59 main_~x~0) 4294967296) 65521) (not (< (mod (+ 59 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5600#(or (< (mod (+ 59 main_~x~0) 4294967296) 65521) (not (< (mod (+ 59 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {5607#(or (not (< (mod (+ main_~x~0 60) 4294967296) 268435455)) (< (mod (+ main_~x~0 60) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5600#(or (< (mod (+ 59 main_~x~0) 4294967296) 65521) (not (< (mod (+ 59 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {5607#(or (not (< (mod (+ main_~x~0 60) 4294967296) 268435455)) (< (mod (+ main_~x~0 60) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5607#(or (not (< (mod (+ main_~x~0 60) 4294967296) 268435455)) (< (mod (+ main_~x~0 60) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {5614#(or (not (< (mod (+ main_~x~0 61) 4294967296) 268435455)) (< (mod (+ main_~x~0 61) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5607#(or (not (< (mod (+ main_~x~0 60) 4294967296) 268435455)) (< (mod (+ main_~x~0 60) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {5614#(or (not (< (mod (+ main_~x~0 61) 4294967296) 268435455)) (< (mod (+ main_~x~0 61) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5614#(or (not (< (mod (+ main_~x~0 61) 4294967296) 268435455)) (< (mod (+ main_~x~0 61) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {5621#(or (< (mod (+ main_~x~0 62) 4294967296) 65521) (not (< (mod (+ main_~x~0 62) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5614#(or (not (< (mod (+ main_~x~0 61) 4294967296) 268435455)) (< (mod (+ main_~x~0 61) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {5621#(or (< (mod (+ main_~x~0 62) 4294967296) 65521) (not (< (mod (+ main_~x~0 62) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5621#(or (< (mod (+ main_~x~0 62) 4294967296) 65521) (not (< (mod (+ main_~x~0 62) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {5628#(or (< (mod (+ main_~x~0 63) 4294967296) 65521) (not (< (mod (+ main_~x~0 63) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5621#(or (< (mod (+ main_~x~0 62) 4294967296) 65521) (not (< (mod (+ main_~x~0 62) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {5628#(or (< (mod (+ main_~x~0 63) 4294967296) 65521) (not (< (mod (+ main_~x~0 63) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5628#(or (< (mod (+ main_~x~0 63) 4294967296) 65521) (not (< (mod (+ main_~x~0 63) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {5635#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 268435455)) (< (mod (+ 64 main_~x~0) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5628#(or (< (mod (+ main_~x~0 63) 4294967296) 65521) (not (< (mod (+ main_~x~0 63) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {5635#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 268435455)) (< (mod (+ 64 main_~x~0) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5635#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 268435455)) (< (mod (+ 64 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {5642#(or (< (mod (+ main_~x~0 65) 4294967296) 65521) (not (< (mod (+ main_~x~0 65) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5635#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 268435455)) (< (mod (+ 64 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {5642#(or (< (mod (+ main_~x~0 65) 4294967296) 65521) (not (< (mod (+ main_~x~0 65) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5642#(or (< (mod (+ main_~x~0 65) 4294967296) 65521) (not (< (mod (+ main_~x~0 65) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {5649#(or (< (mod (+ 66 main_~x~0) 4294967296) 65521) (not (< (mod (+ 66 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5642#(or (< (mod (+ main_~x~0 65) 4294967296) 65521) (not (< (mod (+ main_~x~0 65) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {5649#(or (< (mod (+ 66 main_~x~0) 4294967296) 65521) (not (< (mod (+ 66 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5649#(or (< (mod (+ 66 main_~x~0) 4294967296) 65521) (not (< (mod (+ 66 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {5656#(or (not (< (mod (+ 67 main_~x~0) 4294967296) 268435455)) (< (mod (+ 67 main_~x~0) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5649#(or (< (mod (+ 66 main_~x~0) 4294967296) 65521) (not (< (mod (+ 66 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {5656#(or (not (< (mod (+ 67 main_~x~0) 4294967296) 268435455)) (< (mod (+ 67 main_~x~0) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5656#(or (not (< (mod (+ 67 main_~x~0) 4294967296) 268435455)) (< (mod (+ 67 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {5663#(or (< (mod (+ 68 main_~x~0) 4294967296) 65521) (not (< (mod (+ 68 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5656#(or (not (< (mod (+ 67 main_~x~0) 4294967296) 268435455)) (< (mod (+ 67 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {5663#(or (< (mod (+ 68 main_~x~0) 4294967296) 65521) (not (< (mod (+ 68 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5663#(or (< (mod (+ 68 main_~x~0) 4294967296) 65521) (not (< (mod (+ 68 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {5670#(or (not (< (mod (+ main_~x~0 69) 4294967296) 268435455)) (< (mod (+ main_~x~0 69) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5663#(or (< (mod (+ 68 main_~x~0) 4294967296) 65521) (not (< (mod (+ 68 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {5670#(or (not (< (mod (+ main_~x~0 69) 4294967296) 268435455)) (< (mod (+ main_~x~0 69) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5670#(or (not (< (mod (+ main_~x~0 69) 4294967296) 268435455)) (< (mod (+ main_~x~0 69) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {5677#(or (not (< (mod (+ main_~x~0 70) 4294967296) 268435455)) (< (mod (+ main_~x~0 70) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5670#(or (not (< (mod (+ main_~x~0 69) 4294967296) 268435455)) (< (mod (+ main_~x~0 69) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {5677#(or (not (< (mod (+ main_~x~0 70) 4294967296) 268435455)) (< (mod (+ main_~x~0 70) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5677#(or (not (< (mod (+ main_~x~0 70) 4294967296) 268435455)) (< (mod (+ main_~x~0 70) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {5684#(or (< (mod (+ main_~x~0 71) 4294967296) 65521) (not (< (mod (+ main_~x~0 71) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5677#(or (not (< (mod (+ main_~x~0 70) 4294967296) 268435455)) (< (mod (+ main_~x~0 70) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {5684#(or (< (mod (+ main_~x~0 71) 4294967296) 65521) (not (< (mod (+ main_~x~0 71) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5684#(or (< (mod (+ main_~x~0 71) 4294967296) 65521) (not (< (mod (+ main_~x~0 71) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {5691#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 268435455)) (< (mod (+ 72 main_~x~0) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5684#(or (< (mod (+ main_~x~0 71) 4294967296) 65521) (not (< (mod (+ main_~x~0 71) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {5691#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 268435455)) (< (mod (+ 72 main_~x~0) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5691#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 268435455)) (< (mod (+ 72 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {5698#(or (< (mod (+ main_~x~0 73) 4294967296) 65521) (not (< (mod (+ main_~x~0 73) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5691#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 268435455)) (< (mod (+ 72 main_~x~0) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {5698#(or (< (mod (+ main_~x~0 73) 4294967296) 65521) (not (< (mod (+ main_~x~0 73) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5698#(or (< (mod (+ main_~x~0 73) 4294967296) 65521) (not (< (mod (+ main_~x~0 73) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {5705#(or (not (< (mod (+ main_~x~0 74) 4294967296) 268435455)) (< (mod (+ main_~x~0 74) 4294967296) 65521))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5698#(or (< (mod (+ main_~x~0 73) 4294967296) 65521) (not (< (mod (+ main_~x~0 73) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {5705#(or (not (< (mod (+ main_~x~0 74) 4294967296) 268435455)) (< (mod (+ main_~x~0 74) 4294967296) 65521))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5705#(or (not (< (mod (+ main_~x~0 74) 4294967296) 268435455)) (< (mod (+ main_~x~0 74) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {5712#(or (< (mod (+ main_~x~0 75) 4294967296) 65521) (not (< (mod (+ main_~x~0 75) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65521) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5705#(or (not (< (mod (+ main_~x~0 74) 4294967296) 268435455)) (< (mod (+ main_~x~0 74) 4294967296) 65521))} is VALID [2022-04-27 21:25:40,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {5712#(or (< (mod (+ main_~x~0 75) 4294967296) 65521) (not (< (mod (+ main_~x~0 75) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {5712#(or (< (mod (+ main_~x~0 75) 4294967296) 65521) (not (< (mod (+ main_~x~0 75) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {4867#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {5712#(or (< (mod (+ main_~x~0 75) 4294967296) 65521) (not (< (mod (+ main_~x~0 75) 4294967296) 268435455)))} is VALID [2022-04-27 21:25:40,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {4867#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:40,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4867#true} {4867#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:40,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {4867#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:40,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {4867#true} [47] 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) 13) (= (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] {4867#true} is VALID [2022-04-27 21:25:40,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {4867#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#true} is VALID [2022-04-27 21:25:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 168 proven. 3080 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:25:40,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955317068] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:25:40,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:25:40,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 58, 59] total 117 [2022-04-27 21:25:40,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187610245] [2022-04-27 21:25:40,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:25:40,066 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 2.034188034188034) internal successors, (238), 116 states have internal predecessors, (238), 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 125 [2022-04-27 21:25:40,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:25:40,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 117 states, 117 states have (on average 2.034188034188034) internal successors, (238), 116 states have internal predecessors, (238), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:40,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:25:40,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-04-27 21:25:40,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:25:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-04-27 21:25:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3517, Invalid=10055, Unknown=0, NotChecked=0, Total=13572 [2022-04-27 21:25:40,286 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 117 states, 117 states have (on average 2.034188034188034) internal successors, (238), 116 states have internal predecessors, (238), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:25:48,876 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse11 65521) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65521))) (let ((.cse13 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse13 65521) (not (< .cse13 268435455)))) (let ((.cse14 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65521))) (let ((.cse15 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse18 65521) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65521))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse21 65521) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65521))) (let ((.cse24 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse26 65521) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65521))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse28 65521) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65521))) (let ((.cse30 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse30 65521) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65521))) (let ((.cse35 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse35 65521) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65521))) (let ((.cse37 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse41 65521) (not (< .cse41 268435455)))) (let ((.cse42 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse42 268435455)) (< .cse42 65521))) (let ((.cse43 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse43 65521) (not (< .cse43 268435455)))) (let ((.cse44 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse44 268435455)) (< .cse44 65521))) (let ((.cse45 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (let ((.cse46 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse46 65521) (not (< .cse46 268435455)))) (let ((.cse47 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (let ((.cse48 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse48 65521) (not (< .cse48 268435455)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse49 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse49 268435455)) (< .cse49 65521))) (let ((.cse50 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse50 65521) (not (< .cse50 268435455)))) (let ((.cse51 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse51 268435455)) (< .cse51 65521))) (let ((.cse52 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse52 268435455)) (< .cse52 65521))) (let ((.cse53 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse53 268435455)) (< .cse53 65521))) (let ((.cse54 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse54 65521) (not (< .cse54 268435455))))) is different from false [2022-04-27 21:28:23,571 WARN L232 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 392 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:28:25,724 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse11 65521) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65521))) (let ((.cse13 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse13 65521) (not (< .cse13 268435455)))) (let ((.cse14 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65521))) (let ((.cse15 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse18 65521) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65521))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse21 65521) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65521))) (let ((.cse24 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse26 65521) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65521))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse28 65521) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65521))) (let ((.cse30 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse30 65521) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65521))) (let ((.cse35 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse35 65521) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65521))) (let ((.cse37 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse41 268435455)) (< .cse41 65521))) (let ((.cse42 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse42 65521) (not (< .cse42 268435455)))) (let ((.cse43 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse43 268435455)) (< .cse43 65521))) (let ((.cse44 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse44 65521) (not (< .cse44 268435455)))) (let ((.cse45 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (let ((.cse46 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse46 65521) (not (< .cse46 268435455)))) (let ((.cse47 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse48 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse48 268435455)) (< .cse48 65521))) (let ((.cse49 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse49 65521) (not (< .cse49 268435455)))) (let ((.cse50 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse50 268435455)) (< .cse50 65521))) (let ((.cse51 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse51 268435455)) (< .cse51 65521))) (let ((.cse52 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse52 268435455)) (< .cse52 65521))) (let ((.cse53 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse53 65521) (not (< .cse53 268435455))))) is different from false [2022-04-27 21:28:27,878 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse11 65521) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65521))) (let ((.cse13 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse13 65521) (not (< .cse13 268435455)))) (let ((.cse14 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65521))) (let ((.cse15 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse18 65521) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65521))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse21 65521) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65521))) (let ((.cse24 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse26 65521) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65521))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse28 65521) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65521))) (let ((.cse30 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse30 65521) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65521))) (let ((.cse35 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse35 65521) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65521))) (let ((.cse37 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse41 268435455)) (< .cse41 65521))) (let ((.cse42 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse42 65521) (not (< .cse42 268435455)))) (let ((.cse43 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse43 268435455)) (< .cse43 65521))) (let ((.cse44 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse44 65521) (not (< .cse44 268435455)))) (let ((.cse45 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (let ((.cse46 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse46 65521) (not (< .cse46 268435455)))) (let ((.cse47 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (let ((.cse48 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse48 268435455)) (< .cse48 65521))) (let ((.cse49 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse49 65521) (not (< .cse49 268435455)))) (let ((.cse50 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse50 268435455)) (< .cse50 65521))) (let ((.cse51 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse51 268435455)) (< .cse51 65521))) (let ((.cse52 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse52 268435455)) (< .cse52 65521))) (let ((.cse53 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse53 65521) (not (< .cse53 268435455))))) is different from false [2022-04-27 21:30:44,994 WARN L232 SmtUtils]: Spent 46.53s on a formula simplification. DAG size of input: 243 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:32:49,298 WARN L232 SmtUtils]: Spent 37.57s on a formula simplification. DAG size of input: 249 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:32:51,581 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65521))) (let ((.cse12 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse12 65521) (not (< .cse12 268435455)))) (let ((.cse13 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65521))) (let ((.cse14 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse14 65521) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65521))) (let ((.cse19 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse19 65521) (not (< .cse19 268435455)))) (let ((.cse20 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65521))) (let ((.cse22 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse23 65521) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse26 268435455)) (< .cse26 65521))) (let ((.cse27 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse27 65521) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65521))) (let ((.cse29 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse29 65521) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse30 268435455)) (< .cse30 65521))) (let ((.cse31 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse34 65521) (not (< .cse34 268435455)))) (let ((.cse35 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65521))) (let ((.cse36 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse36 65521) (not (< .cse36 268435455)))) (let ((.cse37 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse41 268435455)) (< .cse41 65521))) (let ((.cse42 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse42 65521) (not (< .cse42 268435455)))) (let ((.cse43 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse43 65521) (not (< .cse43 268435455)))) (let ((.cse44 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse44 65521) (not (< .cse44 268435455)))) (let ((.cse45 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse46 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse46 268435455)) (< .cse46 65521))) (let ((.cse47 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (let ((.cse48 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse48 268435455)) (< .cse48 65521))) (let ((.cse49 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse49 268435455)) (< .cse49 65521))) (let ((.cse50 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse50 268435455)) (< .cse50 65521))) (let ((.cse51 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse51 65521) (not (< .cse51 268435455))))) is different from false [2022-04-27 21:35:06,876 WARN L232 SmtUtils]: Spent 47.33s on a formula simplification. DAG size of input: 270 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:35:08,966 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65521))) (let ((.cse12 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse12 65521) (not (< .cse12 268435455)))) (let ((.cse13 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65521))) (let ((.cse14 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse14 65521) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65521))) (let ((.cse19 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse19 65521) (not (< .cse19 268435455)))) (let ((.cse20 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65521))) (let ((.cse22 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse23 65521) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse26 268435455)) (< .cse26 65521))) (let ((.cse27 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse27 65521) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65521))) (let ((.cse29 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse29 65521) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse30 268435455)) (< .cse30 65521))) (let ((.cse31 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse34 65521) (not (< .cse34 268435455)))) (let ((.cse35 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65521))) (let ((.cse36 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse36 65521) (not (< .cse36 268435455)))) (let ((.cse37 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse41 268435455)) (< .cse41 65521))) (let ((.cse42 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse42 65521) (not (< .cse42 268435455)))) (let ((.cse43 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse43 65521) (not (< .cse43 268435455)))) (let ((.cse44 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse44 65521) (not (< .cse44 268435455)))) (let ((.cse45 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (let ((.cse46 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse46 268435455)) (< .cse46 65521))) (let ((.cse47 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (let ((.cse48 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse48 268435455)) (< .cse48 65521))) (let ((.cse49 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse49 268435455)) (< .cse49 65521))) (let ((.cse50 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse50 268435455)) (< .cse50 65521))) (let ((.cse51 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse51 65521) (not (< .cse51 268435455))))) is different from false [2022-04-27 21:37:19,199 WARN L232 SmtUtils]: Spent 34.09s on a formula simplification. DAG size of input: 229 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)