/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:01:05,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:01:05,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:01:05,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:01:05,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:01:05,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:01:05,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:01:05,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:01:05,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:01:05,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:01:05,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:01:05,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:01:05,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:01:05,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:01:05,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:01:05,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:01:05,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:01:05,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:01:05,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:01:05,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:01:05,619 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:01:05,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:01:05,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:01:05,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:01:05,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:01:05,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:01:05,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:01:05,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:01:05,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:01:05,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:01:05,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:01:05,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:01:05,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:01:05,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:01:05,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:01:05,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:01:05,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:01:05,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:01:05,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:01:05,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:01:05,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:01:05,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:01:05,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:01:05,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:01:05,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:01:05,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:01:05,655 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:01:05,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:01:05,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:01:05,656 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:01:05,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:01:05,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:01:05,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:01:05,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:01:05,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:01:05,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:01:05,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:01:05,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:01:05,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:01:05,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:01:05,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:01:05,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:01:05,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:01:05,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:01:05,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:01:05,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:01:05,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:01:05,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:01:05,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:01:05,659 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:01:05,659 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:01:05,659 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:01:05,659 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 22:01:05,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:01:05,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:01:05,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:01:05,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:01:05,879 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:01:05,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2022-04-07 22:01:05,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0fd6ed8/24aa7b8d99a04a8ea8d61934f4282a5c/FLAG35e4ba5d6 [2022-04-07 22:01:06,291 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:01:06,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2022-04-07 22:01:06,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0fd6ed8/24aa7b8d99a04a8ea8d61934f4282a5c/FLAG35e4ba5d6 [2022-04-07 22:01:06,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0fd6ed8/24aa7b8d99a04a8ea8d61934f4282a5c [2022-04-07 22:01:06,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:01:06,350 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:01:06,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:01:06,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:01:06,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:01:06,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e97ba5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06, skipping insertion in model container [2022-04-07 22:01:06,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:01:06,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:01:06,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2022-04-07 22:01:06,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:01:06,568 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:01:06,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i[807,820] [2022-04-07 22:01:06,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:01:06,590 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:01:06,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06 WrapperNode [2022-04-07 22:01:06,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:01:06,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:01:06,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:01:06,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:01:06,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:01:06,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:01:06,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:01:06,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:01:06,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:01:06,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:06,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 22:01:06,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 22:01:06,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:01:06,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:01:06,680 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:01:06,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:01:06,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:01:06,681 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:01:06,681 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:01:06,681 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:01:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:01:06,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:01:06,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:01:06,734 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:01:06,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:01:06,863 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:01:06,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:01:06,867 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 22:01:06,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:06 BoogieIcfgContainer [2022-04-07 22:01:06,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:01:06,869 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:01:06,869 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:01:06,878 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:01:06,880 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:06" (1/1) ... [2022-04-07 22:01:06,882 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:01:06,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:01:06 BasicIcfg [2022-04-07 22:01:06,915 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:01:06,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:01:06,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:01:06,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:01:06,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:01:06" (1/4) ... [2022-04-07 22:01:06,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7207d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:01:06, skipping insertion in model container [2022-04-07 22:01:06,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:06" (2/4) ... [2022-04-07 22:01:06,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7207d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:01:06, skipping insertion in model container [2022-04-07 22:01:06,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:06" (3/4) ... [2022-04-07 22:01:06,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7207d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:01:06, skipping insertion in model container [2022-04-07 22:01:06,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:01:06" (4/4) ... [2022-04-07 22:01:06,919 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.iqvasr [2022-04-07 22:01:06,922 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:01:06,922 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:01:06,980 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:01:07,002 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:01:07,003 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:01:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:01:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 22:01:07,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:07,020 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:07,021 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1546198667, now seen corresponding path program 1 times [2022-04-07 22:01:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:07,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056248100] [2022-04-07 22:01:07,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:07,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:07,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 22:01:07,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:07,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:07,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:07,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 22:01:07,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:07,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:07,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:07,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-07 22:01:07,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-07 22:01:07,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:07,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-07 22:01:07,424 INFO L272 TraceCheckUtils]: 9: Hoare triple {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:01:07,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:01:07,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 22:01:07,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {24#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 22:01:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:07,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:07,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056248100] [2022-04-07 22:01:07,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056248100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:01:07,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:01:07,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 22:01:07,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049232773] [2022-04-07 22:01:07,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:01:07,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-07 22:01:07,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:07,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:07,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:07,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 22:01:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:07,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 22:01:07,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-07 22:01:07,482 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:07,777 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2022-04-07 22:01:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 22:01:07,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-07 22:01:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-07 22:01:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-07 22:01:07,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-07 22:01:07,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:07,839 INFO L225 Difference]: With dead ends: 41 [2022-04-07 22:01:07,840 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 22:01:07,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-07 22:01:07,843 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:07,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 22:01:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 22:01:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-07 22:01:07,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:07,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:01:07,868 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:01:07,868 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:01:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:07,871 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-07 22:01:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-07 22:01:07,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:07,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:07,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-07 22:01:07,872 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-07 22:01:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:07,874 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-07 22:01:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-07 22:01:07,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:07,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:07,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:07,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:01:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-07 22:01:07,877 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-04-07 22:01:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:07,877 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-07 22:01:07,878 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-07 22:01:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 22:01:07,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:07,878 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:07,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:01:07,879 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:07,879 INFO L85 PathProgramCache]: Analyzing trace with hash 35168483, now seen corresponding path program 1 times [2022-04-07 22:01:07,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:07,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007921962] [2022-04-07 22:01:07,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:08,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {191#true} is VALID [2022-04-07 22:01:08,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191#true} {191#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-07 22:01:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:08,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {191#true} is VALID [2022-04-07 22:01:08,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [67] L14-->L14-2: Formula: (not (= 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[] {191#true} is VALID [2022-04-07 22:01:08,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-07 22:01:08,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:08,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {191#true} is VALID [2022-04-07 22:01:08,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-07 22:01:08,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-07 22:01:08,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {197#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:08,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-07 22:01:08,055 INFO L272 TraceCheckUtils]: 9: Hoare triple {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {191#true} is VALID [2022-04-07 22:01:08,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {191#true} is VALID [2022-04-07 22:01:08,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#true} [67] L14-->L14-2: Formula: (not (= 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[] {191#true} is VALID [2022-04-07 22:01:08,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {191#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,057 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {191#true} {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-07 22:01:08,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-07 22:01:08,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {203#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} is VALID [2022-04-07 22:01:08,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {203#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {204#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-07 22:01:08,060 INFO L272 TraceCheckUtils]: 17: Hoare triple {204#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {205#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:01:08,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {205#(not (= |__VERIFIER_assert_#in~cond| 0))} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {206#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:01:08,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {206#(not (= __VERIFIER_assert_~cond 0))} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 22:01:08,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {192#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 22:01:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:08,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:08,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007921962] [2022-04-07 22:01:08,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007921962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:01:08,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071724896] [2022-04-07 22:01:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:08,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:08,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:08,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:01:08,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 22:01:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:08,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 22:01:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:08,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:01:08,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {191#true} is VALID [2022-04-07 22:01:08,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-07 22:01:08,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-07 22:01:08,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {197#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:08,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:08,556 INFO L272 TraceCheckUtils]: 9: Hoare triple {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {191#true} is VALID [2022-04-07 22:01:08,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {191#true} is VALID [2022-04-07 22:01:08,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#true} [67] L14-->L14-2: Formula: (not (= 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[] {191#true} is VALID [2022-04-07 22:01:08,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {191#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:08,557 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {191#true} {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:08,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:08,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {257#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 22:01:08,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {261#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 22:01:08,560 INFO L272 TraceCheckUtils]: 17: Hoare triple {261#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {265#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-07 22:01:08,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {265#(= |__VERIFIER_assert_#in~cond| 1)} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:01:08,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 22:01:08,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {192#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 22:01:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:08,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:01:09,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {192#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 22:01:09,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {192#false} is VALID [2022-04-07 22:01:09,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {282#(<= 1 |__VERIFIER_assert_#in~cond|)} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:01:09,105 INFO L272 TraceCheckUtils]: 17: Hoare triple {286#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {282#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:01:09,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {290#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {286#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} is VALID [2022-04-07 22:01:09,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {290#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-07 22:01:09,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 22:01:09,113 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {191#true} {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 22:01:09,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {191#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:09,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#true} [67] L14-->L14-2: Formula: (not (= 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[] {191#true} is VALID [2022-04-07 22:01:09,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {191#true} is VALID [2022-04-07 22:01:09,113 INFO L272 TraceCheckUtils]: 9: Hoare triple {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {191#true} is VALID [2022-04-07 22:01:09,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 22:01:09,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {320#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {316#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 22:01:09,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {320#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-07 22:01:09,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {320#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-07 22:01:09,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:09,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:09,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:09,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {191#true} is VALID [2022-04-07 22:01:09,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-07 22:01:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:09,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071724896] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:01:09,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:01:09,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-04-07 22:01:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814733229] [2022-04-07 22:01:09,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:01:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-04-07 22:01:09,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:09,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:01:09,174 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-07 22:01:09,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-07 22:01:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-07 22:01:09,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-04-07 22:01:09,176 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:01:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:09,850 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-07 22:01:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 22:01:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-04-07 22:01:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:01:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-07 22:01:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:01:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-07 22:01:09,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2022-04-07 22:01:09,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:09,897 INFO L225 Difference]: With dead ends: 49 [2022-04-07 22:01:09,897 INFO L226 Difference]: Without dead ends: 39 [2022-04-07 22:01:09,897 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2022-04-07 22:01:09,898 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:09,899 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 61 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 22:01:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-07 22:01:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-07 22:01:09,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:09,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 22:01:09,919 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 22:01:09,919 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 22:01:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:09,921 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-07 22:01:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-07 22:01:09,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:09,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:09,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-07 22:01:09,923 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-07 22:01:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:09,924 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-07 22:01:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-07 22:01:09,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:09,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:09,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:09,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 22:01:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-07 22:01:09,927 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2022-04-07 22:01:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:09,927 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-07 22:01:09,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:01:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-07 22:01:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 22:01:09,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:09,928 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:09,944 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-07 22:01:10,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:10,141 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:10,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:10,142 INFO L85 PathProgramCache]: Analyzing trace with hash -407833038, now seen corresponding path program 1 times [2022-04-07 22:01:10,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:10,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287368451] [2022-04-07 22:01:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:10,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:10,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:10,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {564#true} is VALID [2022-04-07 22:01:10,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {564#true} {564#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-07 22:01:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:10,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:10,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 22:01:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:10,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:10,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-07 22:01:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:10,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 22:01:10,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {564#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:10,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {564#true} is VALID [2022-04-07 22:01:10,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {564#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {564#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {569#(= main_~x~0 0)} is VALID [2022-04-07 22:01:10,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(= main_~x~0 0)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#(= main_~x~0 0)} is VALID [2022-04-07 22:01:10,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#(= main_~x~0 0)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {569#(= main_~x~0 0)} is VALID [2022-04-07 22:01:10,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#(= main_~x~0 0)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:10,311 INFO L272 TraceCheckUtils]: 9: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {564#true} is VALID [2022-04-07 22:01:10,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,312 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {564#true} {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:10,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:10,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:10,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:10,314 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {564#true} is VALID [2022-04-07 22:01:10,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,315 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {564#true} {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:10,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:10,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:10,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 22:01:10,316 INFO L272 TraceCheckUtils]: 25: Hoare triple {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {564#true} is VALID [2022-04-07 22:01:10,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,317 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {564#true} {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 22:01:10,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 22:01:10,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-07 22:01:10,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {565#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {565#false} is VALID [2022-04-07 22:01:10,318 INFO L272 TraceCheckUtils]: 33: Hoare triple {565#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {565#false} is VALID [2022-04-07 22:01:10,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {565#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {565#false} is VALID [2022-04-07 22:01:10,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {565#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-07 22:01:10,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {565#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-07 22:01:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 22:01:10,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:10,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287368451] [2022-04-07 22:01:10,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287368451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:01:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785467480] [2022-04-07 22:01:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:10,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:10,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:10,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:01:10,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 22:01:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:10,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 22:01:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:10,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:01:10,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {564#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {564#true} is VALID [2022-04-07 22:01:10,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {564#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {564#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {569#(= main_~x~0 0)} is VALID [2022-04-07 22:01:10,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(= main_~x~0 0)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#(= main_~x~0 0)} is VALID [2022-04-07 22:01:10,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#(= main_~x~0 0)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {569#(= main_~x~0 0)} is VALID [2022-04-07 22:01:10,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#(= main_~x~0 0)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:10,698 INFO L272 TraceCheckUtils]: 9: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {564#true} is VALID [2022-04-07 22:01:10,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,699 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {564#true} {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:10,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:10,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:10,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:10,701 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {564#true} is VALID [2022-04-07 22:01:10,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,702 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {564#true} {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:10,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:10,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:10,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:10,703 INFO L272 TraceCheckUtils]: 25: Hoare triple {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {564#true} is VALID [2022-04-07 22:01:10,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,705 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {564#true} {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:10,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:10,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-07 22:01:10,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {565#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {565#false} is VALID [2022-04-07 22:01:10,706 INFO L272 TraceCheckUtils]: 33: Hoare triple {565#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {565#false} is VALID [2022-04-07 22:01:10,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {565#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {565#false} is VALID [2022-04-07 22:01:10,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {565#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-07 22:01:10,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {565#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-07 22:01:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 22:01:10,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:01:10,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {565#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-07 22:01:10,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {565#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-07 22:01:10,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {565#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {565#false} is VALID [2022-04-07 22:01:10,884 INFO L272 TraceCheckUtils]: 33: Hoare triple {565#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {565#false} is VALID [2022-04-07 22:01:10,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {565#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {565#false} is VALID [2022-04-07 22:01:10,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {713#(< (mod main_~x~0 4294967296) 10)} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {565#false} is VALID [2022-04-07 22:01:10,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {713#(< (mod main_~x~0 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-07 22:01:10,889 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {564#true} {713#(< (mod main_~x~0 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {713#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-07 22:01:10,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,890 INFO L272 TraceCheckUtils]: 25: Hoare triple {713#(< (mod main_~x~0 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {564#true} is VALID [2022-04-07 22:01:10,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {713#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-07 22:01:10,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-07 22:01:10,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-07 22:01:10,895 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {564#true} {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-07 22:01:10,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,896 INFO L272 TraceCheckUtils]: 17: Hoare triple {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {564#true} is VALID [2022-04-07 22:01:10,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-07 22:01:10,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-07 22:01:10,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-07 22:01:10,897 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {564#true} {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-07 22:01:10,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#true} [67] L14-->L14-2: Formula: (not (= 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[] {564#true} is VALID [2022-04-07 22:01:10,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {564#true} is VALID [2022-04-07 22:01:10,898 INFO L272 TraceCheckUtils]: 9: Hoare triple {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {564#true} is VALID [2022-04-07 22:01:10,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-07 22:01:10,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-07 22:01:10,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-07 22:01:10,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {564#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-07 22:01:10,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {564#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {564#true} is VALID [2022-04-07 22:01:10,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {564#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-07 22:01:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 22:01:10,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785467480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:01:10,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:01:10,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-07 22:01:10,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231087228] [2022-04-07 22:01:10,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:01:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 37 [2022-04-07 22:01:10,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:10,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 22:01:10,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:10,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 22:01:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:10,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 22:01:10,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:01:10,952 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 22:01:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:11,587 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-07 22:01:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 22:01:11,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 37 [2022-04-07 22:01:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 22:01:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-07 22:01:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 22:01:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-07 22:01:11,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2022-04-07 22:01:11,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:11,681 INFO L225 Difference]: With dead ends: 69 [2022-04-07 22:01:11,681 INFO L226 Difference]: Without dead ends: 59 [2022-04-07 22:01:11,682 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2022-04-07 22:01:11,682 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:11,683 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 46 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 22:01:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-07 22:01:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-07 22:01:11,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:11,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 22:01:11,721 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 22:01:11,722 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 22:01:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:11,725 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-07 22:01:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-07 22:01:11,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:11,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:11,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-07 22:01:11,730 INFO L87 Difference]: Start difference. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-07 22:01:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:11,735 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-07 22:01:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-07 22:01:11,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:11,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:11,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:11,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 22:01:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-07 22:01:11,741 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 37 [2022-04-07 22:01:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:11,741 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-07 22:01:11,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 22:01:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-07 22:01:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-07 22:01:11,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:11,747 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:11,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 22:01:11,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 22:01:11,963 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash 562981354, now seen corresponding path program 2 times [2022-04-07 22:01:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:11,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691690129] [2022-04-07 22:01:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:11,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {1174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1128#true} is VALID [2022-04-07 22:01:12,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1128#true} {1128#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-07 22:01:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:12,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 22:01:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:12,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-07 22:01:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-07 22:01:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 22:01:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-07 22:01:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 22:01:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-07 22:01:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 22:01:12,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-07 22:01:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 22:01:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-07 22:01:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:01:12,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:12,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1128#true} is VALID [2022-04-07 22:01:12,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {1133#(= main_~x~0 0)} is VALID [2022-04-07 22:01:12,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#(= main_~x~0 0)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#(= main_~x~0 0)} is VALID [2022-04-07 22:01:12,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {1133#(= main_~x~0 0)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1133#(= main_~x~0 0)} is VALID [2022-04-07 22:01:12,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#(= main_~x~0 0)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:12,208 INFO L272 TraceCheckUtils]: 9: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,208 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1128#true} {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:12,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:12,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:12,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:12,210 INFO L272 TraceCheckUtils]: 17: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,210 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1128#true} {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:12,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:12,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:12,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:12,211 INFO L272 TraceCheckUtils]: 25: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,212 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1128#true} {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:12,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:12,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:12,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 22:01:12,213 INFO L272 TraceCheckUtils]: 33: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,214 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1128#true} {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 22:01:12,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 22:01:12,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 22:01:12,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 22:01:12,215 INFO L272 TraceCheckUtils]: 41: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,216 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1128#true} {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 22:01:12,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 22:01:12,216 INFO L290 TraceCheckUtils]: 47: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 22:01:12,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 22:01:12,217 INFO L272 TraceCheckUtils]: 49: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,217 INFO L290 TraceCheckUtils]: 51: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,217 INFO L290 TraceCheckUtils]: 52: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,217 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1128#true} {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 22:01:12,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 22:01:12,218 INFO L290 TraceCheckUtils]: 55: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 22:01:12,218 INFO L290 TraceCheckUtils]: 56: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 22:01:12,219 INFO L272 TraceCheckUtils]: 57: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,219 INFO L290 TraceCheckUtils]: 59: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,219 INFO L290 TraceCheckUtils]: 60: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,219 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {1128#true} {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 22:01:12,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 22:01:12,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 22:01:12,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:01:12,220 INFO L272 TraceCheckUtils]: 65: Hoare triple {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,221 INFO L290 TraceCheckUtils]: 66: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,221 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1128#true} {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:01:12,221 INFO L290 TraceCheckUtils]: 70: Hoare triple {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 22:01:12,222 INFO L290 TraceCheckUtils]: 71: Hoare triple {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1129#false} is VALID [2022-04-07 22:01:12,222 INFO L290 TraceCheckUtils]: 72: Hoare triple {1129#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1129#false} is VALID [2022-04-07 22:01:12,222 INFO L272 TraceCheckUtils]: 73: Hoare triple {1129#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1129#false} is VALID [2022-04-07 22:01:12,222 INFO L290 TraceCheckUtils]: 74: Hoare triple {1129#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1129#false} is VALID [2022-04-07 22:01:12,222 INFO L290 TraceCheckUtils]: 75: Hoare triple {1129#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1129#false} is VALID [2022-04-07 22:01:12,222 INFO L290 TraceCheckUtils]: 76: Hoare triple {1129#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1129#false} is VALID [2022-04-07 22:01:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 22:01:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:12,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691690129] [2022-04-07 22:01:12,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691690129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:01:12,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207943120] [2022-04-07 22:01:12,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 22:01:12,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:12,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:12,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:01:12,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 22:01:12,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 22:01:12,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:01:12,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 22:01:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:12,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:01:12,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1128#true} is VALID [2022-04-07 22:01:12,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {1133#(= main_~x~0 0)} is VALID [2022-04-07 22:01:12,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#(= main_~x~0 0)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#(= main_~x~0 0)} is VALID [2022-04-07 22:01:12,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {1133#(= main_~x~0 0)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1133#(= main_~x~0 0)} is VALID [2022-04-07 22:01:12,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#(= main_~x~0 0)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:12,831 INFO L272 TraceCheckUtils]: 9: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,832 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1128#true} {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:12,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:12,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 22:01:12,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:12,835 INFO L272 TraceCheckUtils]: 17: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,836 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1128#true} {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:12,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:12,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 22:01:12,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:12,837 INFO L272 TraceCheckUtils]: 25: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,838 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1128#true} {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:12,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:12,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 22:01:12,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 22:01:12,839 INFO L272 TraceCheckUtils]: 33: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,840 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1128#true} {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 22:01:12,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 22:01:12,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 22:01:12,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 22:01:12,841 INFO L272 TraceCheckUtils]: 41: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,842 INFO L290 TraceCheckUtils]: 44: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,842 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1128#true} {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 22:01:12,842 INFO L290 TraceCheckUtils]: 46: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 22:01:12,847 INFO L290 TraceCheckUtils]: 47: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 22:01:12,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 22:01:12,848 INFO L272 TraceCheckUtils]: 49: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,849 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1128#true} {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 22:01:12,849 INFO L290 TraceCheckUtils]: 54: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 22:01:12,849 INFO L290 TraceCheckUtils]: 55: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 22:01:12,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 22:01:12,850 INFO L272 TraceCheckUtils]: 57: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,850 INFO L290 TraceCheckUtils]: 58: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,850 INFO L290 TraceCheckUtils]: 59: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,850 INFO L290 TraceCheckUtils]: 60: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,851 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {1128#true} {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 22:01:12,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 22:01:12,852 INFO L290 TraceCheckUtils]: 63: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 22:01:12,852 INFO L290 TraceCheckUtils]: 64: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 22:01:12,852 INFO L272 TraceCheckUtils]: 65: Hoare triple {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:12,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:12,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:12,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:12,853 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1128#true} {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 22:01:12,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 22:01:12,854 INFO L290 TraceCheckUtils]: 71: Hoare triple {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1129#false} is VALID [2022-04-07 22:01:12,854 INFO L290 TraceCheckUtils]: 72: Hoare triple {1129#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1129#false} is VALID [2022-04-07 22:01:12,854 INFO L272 TraceCheckUtils]: 73: Hoare triple {1129#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1129#false} is VALID [2022-04-07 22:01:12,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {1129#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1129#false} is VALID [2022-04-07 22:01:12,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {1129#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1129#false} is VALID [2022-04-07 22:01:12,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {1129#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1129#false} is VALID [2022-04-07 22:01:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 22:01:12,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:01:13,235 INFO L290 TraceCheckUtils]: 76: Hoare triple {1129#false} [68] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1129#false} is VALID [2022-04-07 22:01:13,235 INFO L290 TraceCheckUtils]: 75: Hoare triple {1129#false} [66] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1129#false} is VALID [2022-04-07 22:01:13,235 INFO L290 TraceCheckUtils]: 74: Hoare triple {1129#false} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1129#false} is VALID [2022-04-07 22:01:13,235 INFO L272 TraceCheckUtils]: 73: Hoare triple {1129#false} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1129#false} is VALID [2022-04-07 22:01:13,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {1129#false} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1129#false} is VALID [2022-04-07 22:01:13,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {1422#(< (mod main_~x~0 4294967296) 10)} [62] L25-->L25-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) 10)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1129#false} is VALID [2022-04-07 22:01:13,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {1422#(< (mod main_~x~0 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1422#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-07 22:01:13,236 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1128#true} {1422#(< (mod main_~x~0 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1422#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-07 22:01:13,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,237 INFO L290 TraceCheckUtils]: 67: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:13,237 INFO L290 TraceCheckUtils]: 66: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:13,237 INFO L272 TraceCheckUtils]: 65: Hoare triple {1422#(< (mod main_~x~0 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:13,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1422#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-07 22:01:13,238 INFO L290 TraceCheckUtils]: 63: Hoare triple {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-07 22:01:13,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-07 22:01:13,239 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {1128#true} {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-07 22:01:13,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:13,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:13,239 INFO L272 TraceCheckUtils]: 57: Hoare triple {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:13,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-07 22:01:13,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-07 22:01:13,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-07 22:01:13,241 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1128#true} {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-07 22:01:13,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:13,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:13,241 INFO L272 TraceCheckUtils]: 49: Hoare triple {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:13,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-07 22:01:13,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-07 22:01:13,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-07 22:01:13,243 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1128#true} {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-07 22:01:13,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:13,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:13,244 INFO L272 TraceCheckUtils]: 41: Hoare triple {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:13,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-07 22:01:13,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-07 22:01:13,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-07 22:01:13,246 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1128#true} {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-07 22:01:13,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:13,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:13,246 INFO L272 TraceCheckUtils]: 33: Hoare triple {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:13,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-07 22:01:13,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-07 22:01:13,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-07 22:01:13,248 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1128#true} {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-07 22:01:13,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:13,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:13,248 INFO L272 TraceCheckUtils]: 25: Hoare triple {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:13,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-07 22:01:13,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-07 22:01:13,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-07 22:01:13,250 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1128#true} {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-07 22:01:13,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:13,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:13,250 INFO L272 TraceCheckUtils]: 17: Hoare triple {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:13,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-07 22:01:13,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-07 22:01:13,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-07 22:01:13,252 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1128#true} {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [73] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-07 22:01:13,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {1128#true} [70] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {1128#true} [67] L14-->L14-2: Formula: (not (= 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[] {1128#true} is VALID [2022-04-07 22:01:13,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {1128#true} [65] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1128#true} is VALID [2022-04-07 22:01:13,252 INFO L272 TraceCheckUtils]: 9: Hoare triple {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} [64] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 0) (= (mod v_main_~sn~0_5 4294967296) (mod (* v_main_~x~0_7 2) 4294967296))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {1128#true} is VALID [2022-04-07 22:01:13,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} [63] L25-2-->L29: Formula: (= v_main_~x~0_4 (+ v_main_~x~0_5 1)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-07 22:01:13,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} [61] L25-->L25-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< (mod v_main_~x~0_1 4294967296) 10)) InVars {main_~sn~0=v_main_~sn~0_2, main_~x~0=v_main_~x~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~sn~0] {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-07 22:01:13,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} [59] L29-1-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-07 22:01:13,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} [55] mainENTRY-->L29-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~sn~0_3 0) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_3 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_3, main_~sn~0=v_main_~sn~0_3, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-07 22:01:13,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} [56] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} [53] 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) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1128#true} is VALID [2022-04-07 22:01:13,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} [51] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-07 22:01:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 22:01:13,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207943120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:01:13,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:01:13,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-07 22:01:13,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066228372] [2022-04-07 22:01:13,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:01:13,257 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 77 [2022-04-07 22:01:13,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:13,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 22:01:13,327 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-07 22:01:13,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 22:01:13,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:13,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 22:01:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-04-07 22:01:13,328 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 22:01:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:14,683 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-07 22:01:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 22:01:14,683 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 77 [2022-04-07 22:01:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 22:01:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-07 22:01:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 22:01:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-07 22:01:14,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2022-04-07 22:01:14,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:14,743 INFO L225 Difference]: With dead ends: 77 [2022-04-07 22:01:14,743 INFO L226 Difference]: Without dead ends: 67 [2022-04-07 22:01:14,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-04-07 22:01:14,744 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:14,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 91 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 22:01:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-07 22:01:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-07 22:01:14,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:14,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 22:01:14,805 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 22:01:14,805 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 22:01:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:14,809 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-07 22:01:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-04-07 22:01:14,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:14,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:14,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 67 states. [2022-04-07 22:01:14,810 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 67 states. [2022-04-07 22:01:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:14,812 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-07 22:01:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-04-07 22:01:14,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:14,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:14,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:14,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 22:01:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-04-07 22:01:14,817 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 77 [2022-04-07 22:01:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:14,819 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-04-07 22:01:14,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 22:01:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-07 22:01:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-07 22:01:14,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:14,820 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:14,838 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-07 22:01:15,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:15,037 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:15,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1970006374, now seen corresponding path program 3 times [2022-04-07 22:01:15,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:15,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677651085] [2022-04-07 22:01:15,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:15,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 22:01:15,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 22:01:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 22:01:15,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 22:01:15,197 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 22:01:15,197 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:01:15,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 22:01:15,200 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-07 22:01:15,202 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:01:15,245 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:01:15,246 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 22:01:15,246 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 22:01:15,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:01:15 BasicIcfg [2022-04-07 22:01:15,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:01:15,253 INFO L158 Benchmark]: Toolchain (without parser) took 8903.25ms. Allocated memory was 200.3MB in the beginning and 284.2MB in the end (delta: 83.9MB). Free memory was 147.2MB in the beginning and 119.9MB in the end (delta: 27.4MB). Peak memory consumption was 111.4MB. Max. memory is 8.0GB. [2022-04-07 22:01:15,254 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory was 163.7MB in the beginning and 163.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:01:15,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.88ms. Allocated memory is still 200.3MB. Free memory was 147.1MB in the beginning and 175.9MB in the end (delta: -28.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 22:01:15,256 INFO L158 Benchmark]: Boogie Preprocessor took 26.65ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 174.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 22:01:15,257 INFO L158 Benchmark]: RCFGBuilder took 248.46ms. Allocated memory is still 200.3MB. Free memory was 174.4MB in the beginning and 163.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 22:01:15,257 INFO L158 Benchmark]: IcfgTransformer took 46.16ms. Allocated memory is still 200.3MB. Free memory was 163.9MB in the beginning and 162.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:01:15,257 INFO L158 Benchmark]: TraceAbstraction took 8336.23ms. Allocated memory was 200.3MB in the beginning and 284.2MB in the end (delta: 83.9MB). Free memory was 162.2MB in the beginning and 119.9MB in the end (delta: 42.4MB). Peak memory consumption was 127.3MB. Max. memory is 8.0GB. [2022-04-07 22:01:15,258 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory was 163.7MB in the beginning and 163.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.88ms. Allocated memory is still 200.3MB. Free memory was 147.1MB in the beginning and 175.9MB in the end (delta: -28.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.65ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 174.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 248.46ms. Allocated memory is still 200.3MB. Free memory was 174.4MB in the beginning and 163.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 46.16ms. Allocated memory is still 200.3MB. Free memory was 163.9MB in the beginning and 162.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8336.23ms. Allocated memory was 200.3MB in the beginning and 284.2MB in the end (delta: 83.9MB). Free memory was 162.2MB in the beginning and 119.9MB in the end (delta: 42.4MB). Peak memory consumption was 127.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int sn=0; [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L23] unsigned int x=0; VAL [loop1=50, n1=51, sn=0, x=0] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=0, x=0] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=2, x=0] [L28] x++ VAL [loop1=50, n1=51, sn=2, x=1] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=2, x=1] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=2, x=1] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=4, x=1] [L28] x++ VAL [loop1=50, n1=51, sn=4, x=2] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=4, x=2] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=4, x=2] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=6, x=2] [L28] x++ VAL [loop1=50, n1=51, sn=6, x=3] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=6, x=3] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=6, x=3] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=8, x=3] [L28] x++ VAL [loop1=50, n1=51, sn=8, x=4] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=8, x=4] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=8, x=4] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=10, x=4] [L28] x++ VAL [loop1=50, n1=51, sn=10, x=5] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=10, x=5] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=10, x=5] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=12, x=5] [L28] x++ VAL [loop1=50, n1=51, sn=12, x=6] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=12, x=6] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=12, x=6] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=14, x=6] [L28] x++ VAL [loop1=50, n1=51, sn=14, x=7] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=14, x=7] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=14, x=7] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=16, x=7] [L28] x++ VAL [loop1=50, n1=51, sn=16, x=8] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=16, x=8] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=16, x=8] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=18, x=8] [L28] x++ VAL [loop1=50, n1=51, sn=18, x=9] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=18, x=9] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=18, x=9] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=20, x=9] [L28] x++ VAL [loop1=50, n1=51, sn=20, x=10] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=20, x=10] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=20, x=10] [L25] COND FALSE !(x<10) VAL [loop1=50, n1=51, sn=20, x=10] [L28] x++ VAL [loop1=50, n1=51, sn=20, x=11] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L15] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 975 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 73 mSDtfsCounter, 975 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 274 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1670 SizeOfPredicates, 6 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 510/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 22:01:15,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...