/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-e106359-m [2022-04-15 00:05:44,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:05:44,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:05:44,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:05:44,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:05:44,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:05:44,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:05:44,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:05:44,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:05:44,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:05:44,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:05:44,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:05:44,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:05:44,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:05:44,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:05:44,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:05:44,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:05:44,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:05:44,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:05:44,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:05:44,299 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:05:44,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:05:44,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:05:44,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:05:44,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:05:44,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:05:44,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:05:44,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:05:44,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:05:44,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:05:44,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:05:44,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:05:44,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:05:44,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:05:44,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:05:44,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:05:44,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:05:44,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:05:44,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:05:44,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:05:44,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:05:44,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:05:44,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:05:44,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:05:44,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:05:44,331 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:05:44,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:05:44,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:05:44,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:05:44,332 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:05:44,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:05:44,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:05:44,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:05:44,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:05:44,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:05:44,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:05:44,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:05:44,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:05:44,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:05:44,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:05:44,334 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:05:44,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:05:44,335 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:05:44,335 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:05:44,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:05:44,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:05:44,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:05:44,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:05:44,523 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:05:44,524 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-15 00:05:44,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ab3ab4d/9d76a01624a644eaa437cfd95ea42d80/FLAGc8ba00b08 [2022-04-15 00:05:44,886 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:05:44,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2022-04-15 00:05:44,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ab3ab4d/9d76a01624a644eaa437cfd95ea42d80/FLAGc8ba00b08 [2022-04-15 00:05:45,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ab3ab4d/9d76a01624a644eaa437cfd95ea42d80 [2022-04-15 00:05:45,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:05:45,322 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:05:45,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:05:45,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:05:45,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:05:45,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ce0b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45, skipping insertion in model container [2022-04-15 00:05:45,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:05:45,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:05:45,466 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-15 00:05:45,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:05:45,491 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:05:45,500 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-15 00:05:45,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:05:45,516 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:05:45,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45 WrapperNode [2022-04-15 00:05:45,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:05:45,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:05:45,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:05:45,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:05:45,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:05:45,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:05:45,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:05:45,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:05:45,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:05:45,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:45,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 00:05:45,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 00:05:45,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:05:45,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:05:45,612 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:05:45,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:05:45,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:05:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:05:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:05:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:05:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:05:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:05:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:05:45,664 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:05:45,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:05:45,767 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:05:45,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:05:45,771 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:05:45,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:45 BoogieIcfgContainer [2022-04-15 00:05:45,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:05:45,773 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:05:45,773 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:05:45,774 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:05:45,776 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:45" (1/1) ... [2022-04-15 00:05:45,777 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:05:45,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:05:45 BasicIcfg [2022-04-15 00:05:45,790 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:05:45,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:05:45,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:05:45,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:05:45,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:05:45" (1/4) ... [2022-04-15 00:05:45,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186f560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:45, skipping insertion in model container [2022-04-15 00:05:45,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:45" (2/4) ... [2022-04-15 00:05:45,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186f560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:45, skipping insertion in model container [2022-04-15 00:05:45,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:45" (3/4) ... [2022-04-15 00:05:45,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186f560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:05:45, skipping insertion in model container [2022-04-15 00:05:45,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:05:45" (4/4) ... [2022-04-15 00:05:45,796 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.iqvasr [2022-04-15 00:05:45,799 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:05:45,799 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:05:45,840 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:05:45,853 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:05:45,853 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:05:45,874 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-15 00:05:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 00:05:45,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:45,878 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:45,878 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1546198667, now seen corresponding path program 1 times [2022-04-15 00:05:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:45,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407995269] [2022-04-15 00:05:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:46,264 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-15 00:05:46,264 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-15 00:05:46,264 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-15 00:05:46,266 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-15 00:05:46,266 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-15 00:05:46,266 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-15 00:05:46,266 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-15 00:05:46,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:05:46,267 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-15 00:05:46,268 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-15 00:05:46,268 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-15 00:05:46,269 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-15 00:05:46,272 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-15 00:05:46,272 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-15 00:05:46,273 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-15 00:05:46,273 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-15 00:05:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:46,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:46,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407995269] [2022-04-15 00:05:46,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407995269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:05:46,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:05:46,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 00:05:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66016279] [2022-04-15 00:05:46,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:05:46,280 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-15 00:05:46,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:46,283 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-15 00:05:46,311 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-15 00:05:46,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:05:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:46,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:05:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:05:46,327 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-15 00:05:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:46,629 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2022-04-15 00:05:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:05:46,630 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-15 00:05:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:46,631 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-15 00:05:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-15 00:05:46,636 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-15 00:05:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-15 00:05:46,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-15 00:05:46,739 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-15 00:05:46,750 INFO L225 Difference]: With dead ends: 41 [2022-04-15 00:05:46,750 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 00:05:46,752 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-15 00:05:46,754 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-15 00:05:46,754 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-15 00:05:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 00:05:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-15 00:05:46,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:46,795 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-15 00:05:46,796 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-15 00:05:46,796 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-15 00:05:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:46,798 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 00:05:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 00:05:46,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:46,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:46,799 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-15 00:05:46,799 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-15 00:05:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:46,801 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 00:05:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 00:05:46,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:46,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:46,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:46,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:46,802 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-15 00:05:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-15 00:05:46,804 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-04-15 00:05:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:46,805 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-15 00:05:46,805 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-15 00:05:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-15 00:05:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 00:05:46,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:46,806 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:46,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:05:46,806 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:46,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash 35168483, now seen corresponding path program 1 times [2022-04-15 00:05:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:46,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108964230] [2022-04-15 00:05:46,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:46,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:47,006 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-15 00:05:47,007 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-15 00:05:47,007 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-15 00:05:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 00:05:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:47,032 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-15 00:05:47,032 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-15 00:05:47,032 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-15 00:05:47,033 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-15 00:05:47,033 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-15 00:05:47,034 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-15 00:05:47,034 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-15 00:05:47,034 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-15 00:05:47,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-15 00:05:47,035 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-15 00:05:47,035 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-15 00:05:47,035 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-15 00:05:47,036 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-15 00:05:47,036 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-15 00:05:47,036 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-15 00:05:47,036 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-15 00:05:47,037 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-15 00:05:47,037 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-15 00:05:47,038 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-15 00:05:47,038 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-15 00:05:47,040 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-15 00:05:47,041 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-15 00:05:47,041 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-15 00:05:47,042 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-15 00:05:47,042 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-15 00:05:47,042 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-15 00:05:47,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:47,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108964230] [2022-04-15 00:05:47,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108964230] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:47,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643760644] [2022-04-15 00:05:47,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:47,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:47,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:47,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:05:47,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 00:05:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:47,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 00:05:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:47,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:47,497 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-15 00:05:47,498 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-15 00:05:47,498 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-15 00:05:47,498 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-15 00:05:47,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-15 00:05:47,499 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-15 00:05:47,499 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-15 00:05:47,500 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-15 00:05:47,500 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-15 00:05:47,500 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-15 00:05:47,501 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-15 00:05:47,501 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-15 00:05:47,501 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-15 00:05:47,501 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-15 00:05:47,502 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-15 00:05:47,503 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-15 00:05:47,503 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-15 00:05:47,504 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-15 00:05:47,505 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-15 00:05:47,505 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-15 00:05:47,505 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-15 00:05:47,505 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-15 00:05:47,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:05:48,098 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-15 00:05:48,099 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-15 00:05:48,099 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-15 00:05:48,100 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-15 00:05:48,106 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-15 00:05:48,106 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-15 00:05:48,107 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-15 00:05:48,108 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-15 00:05:48,108 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-15 00:05:48,108 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-15 00:05:48,108 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-15 00:05:48,108 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-15 00:05:48,110 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-15 00:05:48,111 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-15 00:05:48,112 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-15 00:05:48,112 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-15 00:05:48,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID [2022-04-15 00:05:48,113 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-15 00:05:48,113 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-15 00:05:48,113 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-15 00:05:48,113 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-15 00:05:48,113 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-15 00:05:48,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643760644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:05:48,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:05:48,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-04-15 00:05:48,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464215520] [2022-04-15 00:05:48,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:05:48,115 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-15 00:05:48,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:48,116 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-15 00:05:48,170 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-15 00:05:48,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 00:05:48,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 00:05:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-04-15 00:05:48,172 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-15 00:05:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:48,853 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-15 00:05:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 00:05:48,854 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-15 00:05:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:48,854 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-15 00:05:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-15 00:05:48,857 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-15 00:05:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-15 00:05:48,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2022-04-15 00:05:48,903 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-15 00:05:48,905 INFO L225 Difference]: With dead ends: 49 [2022-04-15 00:05:48,906 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 00:05:48,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2022-04-15 00:05:48,909 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-15 00:05:48,910 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-15 00:05:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 00:05:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-15 00:05:48,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:48,933 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-15 00:05:48,933 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-15 00:05:48,934 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-15 00:05:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:48,936 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 00:05:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 00:05:48,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:48,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:48,937 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-15 00:05:48,938 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-15 00:05:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:48,945 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 00:05:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 00:05:48,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:48,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:48,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:48,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:48,947 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-15 00:05:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 00:05:48,956 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2022-04-15 00:05:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:48,957 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 00:05:48,957 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-15 00:05:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 00:05:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 00:05:48,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:48,958 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:48,987 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-15 00:05:49,158 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-15 00:05:49,159 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash -407833038, now seen corresponding path program 1 times [2022-04-15 00:05:49,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:49,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734916029] [2022-04-15 00:05:49,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:49,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:49,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:49,271 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-15 00:05:49,272 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-15 00:05:49,272 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-15 00:05:49,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 00:05:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:49,278 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-15 00:05:49,278 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-15 00:05:49,279 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-15 00:05:49,279 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-15 00:05:49,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 00:05:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:49,283 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-15 00:05:49,284 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-15 00:05:49,284 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-15 00:05:49,284 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-15 00:05:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 00:05:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:49,289 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-15 00:05:49,289 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-15 00:05:49,289 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-15 00:05:49,290 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-15 00:05:49,290 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-15 00:05:49,290 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-15 00:05:49,290 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-15 00:05:49,291 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-15 00:05:49,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-15 00:05:49,291 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-15 00:05:49,291 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-15 00:05:49,292 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-15 00:05:49,292 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-15 00:05:49,292 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-15 00:05:49,292 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-15 00:05:49,293 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-15 00:05:49,293 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-15 00:05:49,293 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-15 00:05:49,294 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-15 00:05:49,294 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-15 00:05:49,295 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-15 00:05:49,295 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-15 00:05:49,295 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-15 00:05:49,295 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-15 00:05:49,295 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-15 00:05:49,296 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-15 00:05:49,296 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-15 00:05:49,297 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-15 00:05:49,297 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-15 00:05:49,297 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-15 00:05:49,297 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-15 00:05:49,298 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-15 00:05:49,298 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-15 00:05:49,298 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-15 00:05:49,299 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-15 00:05:49,299 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-15 00:05:49,299 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-15 00:05:49,299 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-15 00:05:49,299 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-15 00:05:49,300 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-15 00:05:49,300 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-15 00:05:49,300 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-15 00:05:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:49,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734916029] [2022-04-15 00:05:49,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734916029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:49,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719113438] [2022-04-15 00:05:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:49,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:49,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:05:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:49,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:05:49,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 00:05:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:49,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:49,608 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-15 00:05:49,608 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-15 00:05:49,608 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-15 00:05:49,609 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-15 00:05:49,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-15 00:05:49,611 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-15 00:05:49,612 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-15 00:05:49,612 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-15 00:05:49,613 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-15 00:05:49,613 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-15 00:05:49,613 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-15 00:05:49,613 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-15 00:05:49,613 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-15 00:05:49,614 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-15 00:05:49,614 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-15 00:05:49,615 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-15 00:05:49,616 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-15 00:05:49,616 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-15 00:05:49,616 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-15 00:05:49,616 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-15 00:05:49,616 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-15 00:05:49,617 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-15 00:05:49,617 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-15 00:05:49,618 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-15 00:05:49,618 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-15 00:05:49,618 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-15 00:05:49,618 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-15 00:05:49,619 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-15 00:05:49,619 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-15 00:05:49,620 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-15 00:05:49,620 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-15 00:05:49,621 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-15 00:05:49,621 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-15 00:05:49,621 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-15 00:05:49,621 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-15 00:05:49,621 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-15 00:05:49,621 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-15 00:05:49,621 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-15 00:05:49,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:05:49,754 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-15 00:05:49,755 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-15 00:05:49,755 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-15 00:05:49,755 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-15 00:05:49,755 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-15 00:05:49,756 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-15 00:05:49,757 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-15 00:05:49,757 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-15 00:05:49,757 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-15 00:05:49,758 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-15 00:05:49,758 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-15 00:05:49,759 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-15 00:05:49,763 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-15 00:05:49,763 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-15 00:05:49,763 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-15 00:05:49,764 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-15 00:05:49,764 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-15 00:05:49,764 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-15 00:05:49,764 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-15 00:05:49,764 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-15 00:05:49,765 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-15 00:05:49,765 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-15 00:05:49,766 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-15 00:05:49,767 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-15 00:05:49,770 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-15 00:05:49,770 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-15 00:05:49,770 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-15 00:05:49,770 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-15 00:05:49,771 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-15 00:05:49,771 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-15 00:05:49,771 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-15 00:05:49,772 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-15 00:05:49,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#true} is VALID [2022-04-15 00:05:49,772 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-15 00:05:49,772 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-15 00:05:49,772 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-15 00:05:49,772 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-15 00:05:49,773 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-15 00:05:49,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719113438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:05:49,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:05:49,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 00:05:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194477456] [2022-04-15 00:05:49,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:05:49,774 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-15 00:05:49,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:49,776 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-15 00:05:49,808 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-15 00:05:49,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 00:05:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:49,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 00:05:49,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:05:49,809 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-15 00:05:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:50,433 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-15 00:05:50,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 00:05:50,433 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-15 00:05:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:50,434 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-15 00:05:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-15 00:05:50,436 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-15 00:05:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-15 00:05:50,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2022-04-15 00:05:50,495 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-15 00:05:50,497 INFO L225 Difference]: With dead ends: 69 [2022-04-15 00:05:50,497 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 00:05:50,497 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-15 00:05:50,498 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-15 00:05:50,498 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-15 00:05:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 00:05:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-15 00:05:50,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:50,544 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-15 00:05:50,544 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-15 00:05:50,544 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-15 00:05:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:50,546 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-15 00:05:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-15 00:05:50,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:50,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:50,547 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-15 00:05:50,547 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-15 00:05:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:50,549 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-15 00:05:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-15 00:05:50,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:50,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:50,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:50,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:50,550 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-15 00:05:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-15 00:05:50,551 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 37 [2022-04-15 00:05:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:50,552 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-15 00:05:50,552 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-15 00:05:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-15 00:05:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 00:05:50,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:50,553 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:50,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 00:05:50,769 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-15 00:05:50,769 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash 562981354, now seen corresponding path program 2 times [2022-04-15 00:05:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:50,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418263309] [2022-04-15 00:05:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,917 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-15 00:05:50,917 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-15 00:05:50,917 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-15 00:05:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 00:05:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,924 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-15 00:05:50,924 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-15 00:05:50,924 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-15 00:05:50,924 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-15 00:05:50,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 00:05:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,931 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-15 00:05:50,931 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-15 00:05:50,931 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-15 00:05:50,931 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-15 00:05:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 00:05:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,935 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-15 00:05:50,935 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-15 00:05:50,935 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-15 00:05:50,935 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-15 00:05:50,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 00:05:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,939 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-15 00:05:50,939 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-15 00:05:50,939 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-15 00:05:50,939 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-15 00:05:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-15 00:05:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,943 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-15 00:05:50,943 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-15 00:05:50,943 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-15 00:05:50,943 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-15 00:05:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-15 00:05:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,947 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-15 00:05:50,947 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-15 00:05:50,947 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-15 00:05:50,947 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-15 00:05:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-15 00:05:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,951 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-15 00:05:50,951 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-15 00:05:50,951 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-15 00:05:50,951 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-15 00:05:50,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-15 00:05:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:50,963 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-15 00:05:50,963 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-15 00:05:50,963 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-15 00:05:50,964 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-15 00:05:50,965 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-15 00:05:50,965 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-15 00:05:50,965 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-15 00:05:50,965 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-15 00:05:50,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-15 00:05:50,965 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-15 00:05:50,966 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-15 00:05:50,966 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-15 00:05:50,966 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-15 00:05:50,967 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-15 00:05:50,967 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-15 00:05:50,967 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-15 00:05:50,967 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-15 00:05:50,967 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-15 00:05:50,968 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-15 00:05:50,968 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-15 00:05:50,968 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-15 00:05:50,969 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-15 00:05:50,969 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-15 00:05:50,969 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-15 00:05:50,969 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-15 00:05:50,969 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-15 00:05:50,970 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-15 00:05:50,970 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-15 00:05:50,970 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-15 00:05:50,970 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-15 00:05:50,971 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-15 00:05:50,971 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-15 00:05:50,971 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-15 00:05:50,971 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-15 00:05:50,971 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-15 00:05:50,972 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-15 00:05:50,972 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-15 00:05:50,972 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-15 00:05:50,972 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-15 00:05:50,973 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-15 00:05:50,973 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-15 00:05:50,973 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-15 00:05:50,973 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-15 00:05:50,974 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-15 00:05:50,974 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-15 00:05:50,974 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-15 00:05:50,974 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-15 00:05:50,974 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-15 00:05:50,974 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-15 00:05:50,975 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-15 00:05:50,975 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-15 00:05:50,976 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-15 00:05:50,976 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-15 00:05:50,976 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-15 00:05:50,976 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-15 00:05:50,976 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-15 00:05:50,976 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-15 00:05:50,977 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-15 00:05:50,977 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-15 00:05:50,977 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-15 00:05:50,978 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-15 00:05:50,978 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-15 00:05:50,978 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-15 00:05:50,978 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-15 00:05:50,978 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-15 00:05:50,979 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-15 00:05:50,979 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-15 00:05:50,979 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-15 00:05:50,980 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-15 00:05:50,980 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-15 00:05:50,980 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-15 00:05:50,980 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-15 00:05:50,980 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-15 00:05:50,981 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-15 00:05:50,981 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-15 00:05:50,981 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-15 00:05:50,982 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-15 00:05:50,982 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-15 00:05:50,982 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-15 00:05:50,982 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-15 00:05:50,982 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-15 00:05:50,982 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-15 00:05:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:50,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418263309] [2022-04-15 00:05:50,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418263309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:50,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642495841] [2022-04-15 00:05:50,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:05:50,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:50,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:50,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:05:51,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 00:05:51,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:05:51,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:05:51,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 00:05:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:51,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:51,514 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-15 00:05:51,515 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-15 00:05:51,515 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-15 00:05:51,515 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-15 00:05:51,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-15 00:05:51,515 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-15 00:05:51,515 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-15 00:05:51,516 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-15 00:05:51,516 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-15 00:05:51,516 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-15 00:05:51,516 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-15 00:05:51,516 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-15 00:05:51,516 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-15 00:05:51,519 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-15 00:05:51,520 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-15 00:05:51,520 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-15 00:05:51,521 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-15 00:05:51,521 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-15 00:05:51,521 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-15 00:05:51,521 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-15 00:05:51,521 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-15 00:05:51,521 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-15 00:05:51,522 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-15 00:05:51,522 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-15 00:05:51,522 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-15 00:05:51,523 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-15 00:05:51,523 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-15 00:05:51,523 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-15 00:05:51,523 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-15 00:05:51,523 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-15 00:05:51,524 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-15 00:05:51,524 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-15 00:05:51,524 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-15 00:05:51,525 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-15 00:05:51,525 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-15 00:05:51,525 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-15 00:05:51,525 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-15 00:05:51,525 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-15 00:05:51,526 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-15 00:05:51,526 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-15 00:05:51,526 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-15 00:05:51,526 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-15 00:05:51,526 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-15 00:05:51,527 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-15 00:05:51,527 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-15 00:05:51,527 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-15 00:05:51,527 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-15 00:05:51,528 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-15 00:05:51,528 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-15 00:05:51,528 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-15 00:05:51,528 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-15 00:05:51,528 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-15 00:05:51,528 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-15 00:05:51,529 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-15 00:05:51,533 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-15 00:05:51,534 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-15 00:05:51,534 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-15 00:05:51,534 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-15 00:05:51,534 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-15 00:05:51,534 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-15 00:05:51,534 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-15 00:05:51,535 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-15 00:05:51,535 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-15 00:05:51,536 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-15 00:05:51,536 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-15 00:05:51,536 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-15 00:05:51,536 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-15 00:05:51,536 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-15 00:05:51,536 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-15 00:05:51,537 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-15 00:05:51,537 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-15 00:05:51,537 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-15 00:05:51,538 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-15 00:05:51,538 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-15 00:05:51,538 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-15 00:05:51,538 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-15 00:05:51,538 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-15 00:05:51,538 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-15 00:05:51,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:05:51,891 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-15 00:05:51,891 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-15 00:05:51,891 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-15 00:05:51,891 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-15 00:05:51,891 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-15 00:05:51,894 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-15 00:05:51,894 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-15 00:05:51,895 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-15 00:05:51,895 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-15 00:05:51,895 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-15 00:05:51,895 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-15 00:05:51,895 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-15 00:05:51,896 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-15 00:05:51,896 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-15 00:05:51,896 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-15 00:05:51,897 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-15 00:05:51,897 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-15 00:05:51,897 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-15 00:05:51,897 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-15 00:05:51,897 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-15 00:05:51,898 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-15 00:05:51,898 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-15 00:05:51,898 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-15 00:05:51,899 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-15 00:05:51,899 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-15 00:05:51,899 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-15 00:05:51,899 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-15 00:05:51,899 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-15 00:05:51,900 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-15 00:05:51,900 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-15 00:05:51,901 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-15 00:05:51,901 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-15 00:05:51,901 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-15 00:05:51,901 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-15 00:05:51,901 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-15 00:05:51,901 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-15 00:05:51,902 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-15 00:05:51,902 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-15 00:05:51,903 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-15 00:05:51,903 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-15 00:05:51,903 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-15 00:05:51,903 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-15 00:05:51,903 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-15 00:05:51,903 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-15 00:05:51,904 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-15 00:05:51,904 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-15 00:05:51,905 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-15 00:05:51,905 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-15 00:05:51,905 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-15 00:05:51,905 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-15 00:05:51,905 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-15 00:05:51,905 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-15 00:05:51,906 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-15 00:05:51,906 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-15 00:05:51,907 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-15 00:05:51,907 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-15 00:05:51,907 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-15 00:05:51,907 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-15 00:05:51,907 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-15 00:05:51,907 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-15 00:05:51,908 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-15 00:05:51,908 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-15 00:05:51,908 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-15 00:05:51,909 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-15 00:05:51,909 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-15 00:05:51,909 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-15 00:05:51,909 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-15 00:05:51,909 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-15 00:05:51,910 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-15 00:05:51,911 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-15 00:05:51,911 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-15 00:05:51,912 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-15 00:05:51,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} [52] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1128#true} is VALID [2022-04-15 00:05:51,912 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-15 00:05:51,912 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-15 00:05:51,912 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-15 00:05:51,913 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-15 00:05:51,913 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-15 00:05:51,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642495841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:05:51,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:05:51,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 00:05:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231877523] [2022-04-15 00:05:51,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:05:51,914 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-15 00:05:51,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:51,915 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-15 00:05:52,007 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-15 00:05:52,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 00:05:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 00:05:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-04-15 00:05:52,008 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-15 00:05:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:53,327 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-15 00:05:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 00:05:53,328 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-15 00:05:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:53,328 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-15 00:05:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-15 00:05:53,331 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-15 00:05:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-15 00:05:53,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2022-04-15 00:05:53,394 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-15 00:05:53,396 INFO L225 Difference]: With dead ends: 77 [2022-04-15 00:05:53,396 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 00:05:53,396 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-15 00:05:53,397 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-15 00:05:53,397 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-15 00:05:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 00:05:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-15 00:05:53,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:53,459 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-15 00:05:53,459 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-15 00:05:53,459 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-15 00:05:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:53,462 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-15 00:05:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-04-15 00:05:53,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:53,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:53,462 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-15 00:05:53,463 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-15 00:05:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:53,465 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-15 00:05:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-04-15 00:05:53,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:53,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:53,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:53,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:53,465 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-15 00:05:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-04-15 00:05:53,469 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 77 [2022-04-15 00:05:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:53,469 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-04-15 00:05:53,472 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-15 00:05:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-15 00:05:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 00:05:53,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:53,473 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:53,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 00:05:53,699 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-15 00:05:53,700 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1970006374, now seen corresponding path program 3 times [2022-04-15 00:05:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:53,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285040161] [2022-04-15 00:05:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:05:53,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 00:05:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:05:53,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 00:05:53,839 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 00:05:53,839 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:05:53,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 00:05:53,842 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-15 00:05:53,844 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:05:53,873 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:05:53,874 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:05:53,874 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-15 00:05:53,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:05:53 BasicIcfg [2022-04-15 00:05:53,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:05:53,875 INFO L158 Benchmark]: Toolchain (without parser) took 8561.70ms. Allocated memory was 200.3MB in the beginning and 332.4MB in the end (delta: 132.1MB). Free memory was 173.4MB in the beginning and 130.5MB in the end (delta: 42.9MB). Peak memory consumption was 175.5MB. Max. memory is 8.0GB. [2022-04-15 00:05:53,886 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:05:53,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.76ms. Allocated memory was 200.3MB in the beginning and 276.8MB in the end (delta: 76.5MB). Free memory was 173.0MB in the beginning and 247.8MB in the end (delta: -74.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-15 00:05:53,886 INFO L158 Benchmark]: Boogie Preprocessor took 36.42ms. Allocated memory is still 276.8MB. Free memory was 247.8MB in the beginning and 246.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:05:53,886 INFO L158 Benchmark]: RCFGBuilder took 218.35ms. Allocated memory is still 276.8MB. Free memory was 246.3MB in the beginning and 235.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 00:05:53,886 INFO L158 Benchmark]: IcfgTransformer took 16.78ms. Allocated memory is still 276.8MB. Free memory was 235.4MB in the beginning and 234.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:05:53,887 INFO L158 Benchmark]: TraceAbstraction took 8083.12ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 233.8MB in the beginning and 130.5MB in the end (delta: 103.2MB). Peak memory consumption was 159.7MB. Max. memory is 8.0GB. [2022-04-15 00:05:53,888 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 is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.76ms. Allocated memory was 200.3MB in the beginning and 276.8MB in the end (delta: 76.5MB). Free memory was 173.0MB in the beginning and 247.8MB in the end (delta: -74.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.42ms. Allocated memory is still 276.8MB. Free memory was 247.8MB in the beginning and 246.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 218.35ms. Allocated memory is still 276.8MB. Free memory was 246.3MB in the beginning and 235.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 16.78ms. Allocated memory is still 276.8MB. Free memory was 235.4MB in the beginning and 234.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8083.12ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 233.8MB in the beginning and 130.5MB in the end (delta: 103.2MB). Peak memory consumption was 159.7MB. 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.0s, 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.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.1s 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.0s 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.0s 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-15 00:05:53,911 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...