/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:05:11,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:05:11,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:05:11,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:05:11,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:05:11,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:05:11,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:05:11,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:05:11,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:05:11,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:05:11,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:05:11,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:05:11,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:05:11,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:05:11,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:05:11,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:05:11,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:05:11,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:05:11,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:05:11,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:05:11,347 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:05:11,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:05:11,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:05:11,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:05:11,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:05:11,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:05:11,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:05:11,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:05:11,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:05:11,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:05:11,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:05:11,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:05:11,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:05:11,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:05:11,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:05:11,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:05:11,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:05:11,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:05:11,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:05:11,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:05:11,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:05:11,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:05:11,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:05:11,379 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:05:11,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:05:11,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:05:11,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:05:11,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:05:11,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:05:11,381 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:05:11,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:05:11,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:05:11,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:05:11,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:05:11,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:05:11,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:05:11,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:05:11,382 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:05:11,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:05:11,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:05:11,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:05:11,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:05:11,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:05:11,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:05:11,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:05:11,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:05:11,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:05:11,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:05:11,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:05:11,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:05:11,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:05:11,384 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:05:11,385 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 23:05:11,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:05:11,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:05:11,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:05:11,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:05:11,580 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:05:11,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-07 23:05:11,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd8e0de8/af00771800324878b0ca1ed5ed876e26/FLAG479505f60 [2022-04-07 23:05:12,022 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:05:12,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-07 23:05:12,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd8e0de8/af00771800324878b0ca1ed5ed876e26/FLAG479505f60 [2022-04-07 23:05:12,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd8e0de8/af00771800324878b0ca1ed5ed876e26 [2022-04-07 23:05:12,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:05:12,036 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:05:12,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:05:12,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:05:12,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:05:12,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eda1e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12, skipping insertion in model container [2022-04-07 23:05:12,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:05:12,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:05:12,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c[319,332] [2022-04-07 23:05:12,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:05:12,173 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:05:12,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c[319,332] [2022-04-07 23:05:12,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:05:12,190 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:05:12,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12 WrapperNode [2022-04-07 23:05:12,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:05:12,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:05:12,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:05:12,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:05:12,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:05:12,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:05:12,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:05:12,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:05:12,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:05:12,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:05:12,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 23:05:12,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 23:05:12,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:05:12,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:05:12,274 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:05:12,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:05:12,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:05:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:05:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:05:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:05:12,312 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:05:12,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:05:12,390 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:05:12,395 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:05:12,395 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:05:12,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:05:12 BoogieIcfgContainer [2022-04-07 23:05:12,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:05:12,397 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:05:12,397 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:05:12,397 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:05:12,400 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:05:12" (1/1) ... [2022-04-07 23:05:12,401 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:05:12,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:05:12 BasicIcfg [2022-04-07 23:05:12,420 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:05:12,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:05:12,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:05:12,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:05:12,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:05:12" (1/4) ... [2022-04-07 23:05:12,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4494127b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:05:12, skipping insertion in model container [2022-04-07 23:05:12,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:05:12" (2/4) ... [2022-04-07 23:05:12,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4494127b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:05:12, skipping insertion in model container [2022-04-07 23:05:12,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:05:12" (3/4) ... [2022-04-07 23:05:12,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4494127b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:05:12, skipping insertion in model container [2022-04-07 23:05:12,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:05:12" (4/4) ... [2022-04-07 23:05:12,425 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.cqvasr [2022-04-07 23:05:12,428 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:05:12,428 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:05:12,477 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:05:12,482 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 23:05:12,482 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:05:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 23:05:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 23:05:12,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:05:12,509 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:05:12,509 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:05:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:05:12,513 INFO L85 PathProgramCache]: Analyzing trace with hash -154368955, now seen corresponding path program 1 times [2022-04-07 23:05:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:05:12,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712626837] [2022-04-07 23:05:12,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:05:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:05:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:12,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 23:05:12,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:05:12,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:05:12,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:05:12,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 23:05:12,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:05:12,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:05:12,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:05:12,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {23#true} is VALID [2022-04-07 23:05:12,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [52] L9-2-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 23:05:12,667 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {24#false} is VALID [2022-04-07 23:05:12,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-07 23:05:12,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 23:05:12,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 23:05:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:05:12,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712626837] [2022-04-07 23:05:12,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712626837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:05:12,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:05:12,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:05:12,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686111282] [2022-04-07 23:05:12,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:05:12,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 23:05:12,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:05:12,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:12,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:12,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:05:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:05:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:05:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:05:12,729 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:12,809 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-07 23:05:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:05:12,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 23:05:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:05:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 23:05:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 23:05:12,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-07 23:05:12,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:12,871 INFO L225 Difference]: With dead ends: 32 [2022-04-07 23:05:12,871 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 23:05:12,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:05:12,875 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:05:12,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:05:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 23:05:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 23:05:12,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:05:12,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:12,893 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:12,893 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:12,895 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-07 23:05:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-07 23:05:12,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:12,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:12,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 23:05:12,895 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 23:05:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:12,897 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-07 23:05:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-07 23:05:12,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:12,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:12,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:05:12,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:05:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-07 23:05:12,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-07 23:05:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:05:12,900 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-07 23:05:12,900 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-07 23:05:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 23:05:12,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:05:12,900 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:05:12,901 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:05:12,901 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:05:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:05:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash -153445434, now seen corresponding path program 1 times [2022-04-07 23:05:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:05:12,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71298618] [2022-04-07 23:05:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:05:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:12,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:05:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:12,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {118#true} is VALID [2022-04-07 23:05:12,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:05:12,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:05:12,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:05:12,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {118#true} is VALID [2022-04-07 23:05:12,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:05:12,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:05:12,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:05:12,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {123#(= main_~x~0 0)} is VALID [2022-04-07 23:05:12,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#(= main_~x~0 0)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-07 23:05:12,988 INFO L272 TraceCheckUtils]: 7: Hoare triple {119#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {119#false} is VALID [2022-04-07 23:05:12,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {119#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {119#false} is VALID [2022-04-07 23:05:12,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-07 23:05:12,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-07 23:05:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:12,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:05:12,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71298618] [2022-04-07 23:05:12,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71298618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:05:12,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:05:12,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 23:05:12,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157624913] [2022-04-07 23:05:12,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:05:12,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 23:05:12,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:05:12,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:13,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 23:05:13,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:05:13,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 23:05:13,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 23:05:13,003 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:13,065 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-07 23:05:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 23:05:13,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 23:05:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:05:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-07 23:05:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-07 23:05:13,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-07 23:05:13,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:13,098 INFO L225 Difference]: With dead ends: 22 [2022-04-07 23:05:13,098 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 23:05:13,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:05:13,103 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:05:13,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:05:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 23:05:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 23:05:13,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:05:13,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,110 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,111 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:13,112 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 23:05:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 23:05:13,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:13,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:13,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 23:05:13,113 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 23:05:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:13,115 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 23:05:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 23:05:13,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:13,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:13,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:05:13,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:05:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-07 23:05:13,117 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-07 23:05:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:05:13,117 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-07 23:05:13,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 23:05:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 23:05:13,119 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:05:13,119 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:05:13,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 23:05:13,119 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:05:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:05:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash -521762940, now seen corresponding path program 1 times [2022-04-07 23:05:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:05:13,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223078224] [2022-04-07 23:05:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:05:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:05:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:13,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {215#true} is VALID [2022-04-07 23:05:13,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:05:13,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {215#true} is VALID [2022-04-07 23:05:13,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {220#(= main_~x~0 0)} is VALID [2022-04-07 23:05:13,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {220#(= main_~x~0 0)} is VALID [2022-04-07 23:05:13,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {221#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:05:13,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-07 23:05:13,222 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {216#false} is VALID [2022-04-07 23:05:13,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {216#false} is VALID [2022-04-07 23:05:13,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-07 23:05:13,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-07 23:05:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:05:13,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223078224] [2022-04-07 23:05:13,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223078224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:05:13,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625512018] [2022-04-07 23:05:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:13,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:05:13,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:05:13,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 23:05:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:13,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 23:05:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:13,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:05:13,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {215#true} is VALID [2022-04-07 23:05:13,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {220#(= main_~x~0 0)} is VALID [2022-04-07 23:05:13,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {220#(= main_~x~0 0)} is VALID [2022-04-07 23:05:13,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {247#(= main_~x~0 1)} is VALID [2022-04-07 23:05:13,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#(= main_~x~0 1)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-07 23:05:13,394 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {216#false} is VALID [2022-04-07 23:05:13,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {216#false} is VALID [2022-04-07 23:05:13,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-07 23:05:13,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-07 23:05:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:13,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:05:13,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-07 23:05:13,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-07 23:05:13,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {216#false} is VALID [2022-04-07 23:05:13,466 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {216#false} is VALID [2022-04-07 23:05:13,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(< (mod main_~x~0 4294967296) 100000000)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {216#false} is VALID [2022-04-07 23:05:13,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {279#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {275#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-07 23:05:13,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {279#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {279#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} is VALID [2022-04-07 23:05:13,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {279#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} is VALID [2022-04-07 23:05:13,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {215#true} is VALID [2022-04-07 23:05:13,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#true} is VALID [2022-04-07 23:05:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:13,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625512018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:05:13,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:05:13,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 23:05:13,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760208786] [2022-04-07 23:05:13,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:05:13,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 23:05:13,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:05:13,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:13,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 23:05:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:05:13,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 23:05:13,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-07 23:05:13,483 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:13,651 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-07 23:05:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 23:05:13,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 23:05:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:05:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-07 23:05:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-07 23:05:13,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-07 23:05:13,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:13,691 INFO L225 Difference]: With dead ends: 26 [2022-04-07 23:05:13,691 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 23:05:13,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-07 23:05:13,692 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:05:13,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:05:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 23:05:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-07 23:05:13,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:05:13,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,697 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,697 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:13,698 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 23:05:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 23:05:13,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:13,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:13,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-07 23:05:13,699 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-07 23:05:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:13,700 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 23:05:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 23:05:13,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:13,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:13,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:05:13,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:05:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-07 23:05:13,701 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-07 23:05:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:05:13,701 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-07 23:05:13,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-07 23:05:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 23:05:13,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:05:13,702 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:05:13,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 23:05:13,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:13,918 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:05:13,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:05:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1609511199, now seen corresponding path program 1 times [2022-04-07 23:05:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:05:13,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527966380] [2022-04-07 23:05:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:05:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:14,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:05:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:14,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {416#true} is VALID [2022-04-07 23:05:14,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {416#true} {416#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:05:14,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {416#true} is VALID [2022-04-07 23:05:14,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {421#(= main_~x~0 0)} is VALID [2022-04-07 23:05:14,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {421#(= main_~x~0 0)} is VALID [2022-04-07 23:05:14,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:14,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:14,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {423#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:14,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {423#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:14,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {417#false} is VALID [2022-04-07 23:05:14,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-07 23:05:14,026 INFO L272 TraceCheckUtils]: 13: Hoare triple {417#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {417#false} is VALID [2022-04-07 23:05:14,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {417#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {417#false} is VALID [2022-04-07 23:05:14,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-07 23:05:14,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {417#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-07 23:05:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:14,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:05:14,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527966380] [2022-04-07 23:05:14,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527966380] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:05:14,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646042659] [2022-04-07 23:05:14,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:14,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:14,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:05:14,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:05:14,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 23:05:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:14,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 23:05:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:14,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:05:14,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {416#true} is VALID [2022-04-07 23:05:14,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {421#(= main_~x~0 0)} is VALID [2022-04-07 23:05:14,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {421#(= main_~x~0 0)} is VALID [2022-04-07 23:05:14,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:14,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:14,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:14,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:14,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {462#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:14,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {462#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {462#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:14,362 INFO L272 TraceCheckUtils]: 13: Hoare triple {462#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {469#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:05:14,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {473#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:05:14,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(<= 1 __VERIFIER_assert_~cond)} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-07 23:05:14,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {417#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-07 23:05:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:14,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:05:14,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {417#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-07 23:05:14,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(<= 1 __VERIFIER_assert_~cond)} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {417#false} is VALID [2022-04-07 23:05:14,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {473#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:05:14,475 INFO L272 TraceCheckUtils]: 13: Hoare triple {489#(= (mod main_~x~0 2) 0)} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {469#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:05:14,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(= (mod main_~x~0 2) 0)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 23:05:14,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(= (mod main_~x~0 2) 0)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 23:05:14,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(= (mod main_~x~0 2) 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 23:05:14,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#(= (mod (+ main_~x~0 1) 2) 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 23:05:14,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#(= (mod (+ main_~x~0 1) 2) 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {502#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 23:05:14,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#(= (mod main_~x~0 2) 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {502#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 23:05:14,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(= (mod main_~x~0 2) 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 23:05:14,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {489#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 23:05:14,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {416#true} is VALID [2022-04-07 23:05:14,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {416#true} is VALID [2022-04-07 23:05:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 23:05:14,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646042659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:05:14,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:05:14,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-04-07 23:05:14,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605585098] [2022-04-07 23:05:14,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:05:14,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 23:05:14,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:05:14,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:14,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:14,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 23:05:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:05:14,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 23:05:14,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-07 23:05:14,525 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:14,825 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-07 23:05:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 23:05:14,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 23:05:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:05:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-07 23:05:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-07 23:05:14,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2022-04-07 23:05:14,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:14,856 INFO L225 Difference]: With dead ends: 34 [2022-04-07 23:05:14,856 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 23:05:14,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-07 23:05:14,857 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:05:14,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:05:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 23:05:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-07 23:05:14,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:05:14,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:14,865 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:14,865 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:14,866 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 23:05:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-07 23:05:14,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:14,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:14,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 23:05:14,867 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 23:05:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:14,868 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 23:05:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-07 23:05:14,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:14,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:14,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:05:14,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:05:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-07 23:05:14,869 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-07 23:05:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:05:14,869 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-07 23:05:14,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-07 23:05:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 23:05:14,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:05:14,870 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:05:14,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 23:05:15,088 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 23:05:15,088 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:05:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:05:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash -251734435, now seen corresponding path program 2 times [2022-04-07 23:05:15,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:05:15,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488765684] [2022-04-07 23:05:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:05:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:15,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:05:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:15,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {679#true} is VALID [2022-04-07 23:05:15,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {679#true} {679#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {679#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:05:15,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {679#true} is VALID [2022-04-07 23:05:15,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {679#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {679#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {679#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {684#(= main_~x~0 0)} is VALID [2022-04-07 23:05:15,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {684#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {684#(= main_~x~0 0)} is VALID [2022-04-07 23:05:15,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {684#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:15,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:15,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:15,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:15,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {687#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 23:05:15,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {687#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 23:05:15,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {687#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {680#false} is VALID [2022-04-07 23:05:15,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {680#false} is VALID [2022-04-07 23:05:15,182 INFO L272 TraceCheckUtils]: 15: Hoare triple {680#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {680#false} is VALID [2022-04-07 23:05:15,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {680#false} is VALID [2022-04-07 23:05:15,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {680#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {680#false} is VALID [2022-04-07 23:05:15,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#false} is VALID [2022-04-07 23:05:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:05:15,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488765684] [2022-04-07 23:05:15,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488765684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:05:15,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067699550] [2022-04-07 23:05:15,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 23:05:15,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:15,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:05:15,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:05:15,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 23:05:15,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 23:05:15,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:05:15,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 23:05:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:15,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:05:15,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {679#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {679#true} is VALID [2022-04-07 23:05:15,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {679#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {679#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {679#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {684#(= main_~x~0 0)} is VALID [2022-04-07 23:05:15,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {684#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {684#(= main_~x~0 0)} is VALID [2022-04-07 23:05:15,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {684#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:15,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:15,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:15,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:15,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {686#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:15,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:15,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {732#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:15,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {732#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {680#false} is VALID [2022-04-07 23:05:15,402 INFO L272 TraceCheckUtils]: 15: Hoare triple {680#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {680#false} is VALID [2022-04-07 23:05:15,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {680#false} is VALID [2022-04-07 23:05:15,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {680#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {680#false} is VALID [2022-04-07 23:05:15,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#false} is VALID [2022-04-07 23:05:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:15,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:05:15,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {680#false} is VALID [2022-04-07 23:05:15,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {680#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {680#false} is VALID [2022-04-07 23:05:15,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {680#false} is VALID [2022-04-07 23:05:15,511 INFO L272 TraceCheckUtils]: 15: Hoare triple {680#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {680#false} is VALID [2022-04-07 23:05:15,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#(< (mod main_~x~0 4294967296) 100000000)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {680#false} is VALID [2022-04-07 23:05:15,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {760#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-07 23:05:15,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {764#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-07 23:05:15,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {771#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {764#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-07 23:05:15,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {771#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {771#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-07 23:05:15,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {778#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {771#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-07 23:05:15,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {778#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {778#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-07 23:05:15,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {785#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {778#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-07 23:05:15,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {785#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {785#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-07 23:05:15,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {679#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {785#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-07 23:05:15,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {679#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {679#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {679#true} is VALID [2022-04-07 23:05:15,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {679#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {679#true} is VALID [2022-04-07 23:05:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:05:15,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067699550] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:05:15,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:05:15,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-04-07 23:05:15,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88377971] [2022-04-07 23:05:15,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:05:15,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 23:05:15,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:05:15,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:15,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:15,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 23:05:15,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:05:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 23:05:15,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-04-07 23:05:15,542 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:15,872 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-07 23:05:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 23:05:15,873 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 23:05:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:05:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-07 23:05:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-07 23:05:15,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-07 23:05:15,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:15,967 INFO L225 Difference]: With dead ends: 43 [2022-04-07 23:05:15,967 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 23:05:15,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2022-04-07 23:05:15,968 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:05:15,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 38 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:05:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 23:05:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-07 23:05:15,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:05:15,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:15,982 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:15,982 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:15,983 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 23:05:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 23:05:15,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:15,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:15,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-07 23:05:15,984 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-07 23:05:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:15,985 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 23:05:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 23:05:15,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:15,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:15,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:05:15,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:05:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-07 23:05:15,986 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-04-07 23:05:15,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:05:15,986 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-07 23:05:15,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-07 23:05:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 23:05:15,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:05:15,987 INFO L499 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:05:16,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 23:05:16,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:16,203 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:05:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:05:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash -151822765, now seen corresponding path program 3 times [2022-04-07 23:05:16,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:05:16,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763100008] [2022-04-07 23:05:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:05:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:05:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:16,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {1009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {998#true} is VALID [2022-04-07 23:05:16,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {998#true} {998#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {998#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:05:16,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {998#true} is VALID [2022-04-07 23:05:16,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {998#true} {998#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {998#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {998#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1003#(= main_~x~0 0)} is VALID [2022-04-07 23:05:16,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {1003#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1003#(= main_~x~0 0)} is VALID [2022-04-07 23:05:16,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1004#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:16,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {1004#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1004#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:16,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1004#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:16,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {1005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:16,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {1005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1006#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:16,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1006#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:16,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {1006#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:16,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {1007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:16,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {1007#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1008#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:16,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1008#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:16,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {1008#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {999#false} is VALID [2022-04-07 23:05:16,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:16,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {999#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {999#false} is VALID [2022-04-07 23:05:16,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {999#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:16,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {999#false} is VALID [2022-04-07 23:05:16,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {999#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:16,364 INFO L272 TraceCheckUtils]: 23: Hoare triple {999#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {999#false} is VALID [2022-04-07 23:05:16,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {999#false} is VALID [2022-04-07 23:05:16,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:16,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 23:05:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:05:16,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763100008] [2022-04-07 23:05:16,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763100008] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:05:16,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902245162] [2022-04-07 23:05:16,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 23:05:16,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:16,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:05:16,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:05:16,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 23:05:16,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-07 23:05:16,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:05:16,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 23:05:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:16,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:05:16,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {998#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {998#true} is VALID [2022-04-07 23:05:16,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {998#true} {998#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {998#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {998#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {998#true} is VALID [2022-04-07 23:05:16,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:16,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1058#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-07 23:05:16,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {1058#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1058#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-07 23:05:16,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {1058#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1065#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-07 23:05:16,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {1065#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1065#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-07 23:05:16,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {1065#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1072#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 23:05:16,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1072#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 23:05:16,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {1072#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1079#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 23:05:16,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {1079#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967292 main_~x~0) 4294967296)))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:16,973 INFO L272 TraceCheckUtils]: 23: Hoare triple {999#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {999#false} is VALID [2022-04-07 23:05:16,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {999#false} is VALID [2022-04-07 23:05:16,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:16,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-07 23:05:16,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:05:17,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:17,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:17,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {999#false} is VALID [2022-04-07 23:05:17,462 INFO L272 TraceCheckUtils]: 23: Hoare triple {999#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {999#false} is VALID [2022-04-07 23:05:17,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {1107#(< (mod main_~x~0 4294967296) 100000000)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-07 23:05:17,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {1111#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1107#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-07 23:05:17,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {1115#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1111#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-07 23:05:17,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {1119#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1115#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-07 23:05:17,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {1119#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1119#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-07 23:05:17,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {1126#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1119#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-07 23:05:17,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {1126#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1126#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-07 23:05:17,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1126#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-07 23:05:17,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:17,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {998#true} is VALID [2022-04-07 23:05:17,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {998#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {998#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {998#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {998#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {998#true} {998#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {998#true} is VALID [2022-04-07 23:05:17,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {998#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-07 23:05:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-07 23:05:17,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902245162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:05:17,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:05:17,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 18 [2022-04-07 23:05:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328590666] [2022-04-07 23:05:17,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:05:17,477 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 23:05:17,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:05:17,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:17,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:17,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 23:05:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:05:17,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 23:05:17,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-04-07 23:05:17,521 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:19,427 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2022-04-07 23:05:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-07 23:05:19,427 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 23:05:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:05:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-07 23:05:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-07 23:05:19,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2022-04-07 23:05:19,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:19,547 INFO L225 Difference]: With dead ends: 75 [2022-04-07 23:05:19,547 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 23:05:19,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 23:05:19,551 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 23:05:19,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 43 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 23:05:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 23:05:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-04-07 23:05:19,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:05:19,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:19,597 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:19,597 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:19,599 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-07 23:05:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-07 23:05:19,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:19,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:19,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-07 23:05:19,600 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-07 23:05:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:19,601 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-07 23:05:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-07 23:05:19,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:19,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:19,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:05:19,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:05:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-07 23:05:19,603 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 27 [2022-04-07 23:05:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:05:19,603 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-07 23:05:19,603 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-07 23:05:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 23:05:19,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:05:19,604 INFO L499 BasicCegarLoop]: trace histogram [15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:05:19,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 23:05:19,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:19,807 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:05:19,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:05:19,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1469545376, now seen corresponding path program 4 times [2022-04-07 23:05:19,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:05:19,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206915103] [2022-04-07 23:05:19,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:19,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:05:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:05:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:19,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {1544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {1531#true} is VALID [2022-04-07 23:05:19,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:19,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1531#true} {1531#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:19,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:05:19,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {1544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {1531#true} is VALID [2022-04-07 23:05:19,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {1531#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:19,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1531#true} {1531#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:19,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {1531#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:19,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {1531#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1536#(= main_~x~0 0)} is VALID [2022-04-07 23:05:19,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {1536#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1536#(= main_~x~0 0)} is VALID [2022-04-07 23:05:19,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:19,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:19,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:19,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:19,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:19,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:19,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:19,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:19,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:19,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:19,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:05:19,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:05:19,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1543#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-07 23:05:19,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {1543#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1543#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-07 23:05:19,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {1543#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:19,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:19,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:19,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:19,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:19,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:19,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:19,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:19,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {1532#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,960 INFO L272 TraceCheckUtils]: 37: Hoare triple {1532#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1532#false} is VALID [2022-04-07 23:05:19,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {1532#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1532#false} is VALID [2022-04-07 23:05:19,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {1532#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {1532#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 23:05:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:05:19,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206915103] [2022-04-07 23:05:19,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206915103] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:05:19,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898823272] [2022-04-07 23:05:19,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 23:05:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:19,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:05:19,963 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:05:19,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 23:05:20,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 23:05:20,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:05:20,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 23:05:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:20,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:05:20,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:20,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {1531#true} is VALID [2022-04-07 23:05:20,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {1531#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:20,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1531#true} {1531#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:20,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {1531#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:20,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {1531#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1536#(= main_~x~0 0)} is VALID [2022-04-07 23:05:20,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {1536#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1536#(= main_~x~0 0)} is VALID [2022-04-07 23:05:20,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {1536#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:20,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:20,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {1537#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:20,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:20,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {1538#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:20,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:20,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:20,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:20,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {1540#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:20,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:20,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {1541#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:05:20,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:05:20,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1605#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:05:20,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {1605#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1605#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:05:20,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {1605#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {1532#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L272 TraceCheckUtils]: 37: Hoare triple {1532#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {1532#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1532#false} is VALID [2022-04-07 23:05:20,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {1532#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {1532#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 23:05:20,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:05:20,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {1532#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {1532#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {1532#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L272 TraceCheckUtils]: 37: Hoare triple {1532#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {1532#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {1532#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {1532#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#false} is VALID [2022-04-07 23:05:20,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#(< (mod main_~x~0 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#false} is VALID [2022-04-07 23:05:20,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {1730#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1726#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-07 23:05:20,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {1734#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1730#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-07 23:05:20,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {1734#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1734#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:20,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {1741#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1734#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:20,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {1741#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1741#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:20,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {1748#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1741#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:20,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {1748#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1748#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-07 23:05:20,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {1755#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1748#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-07 23:05:20,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {1755#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1755#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:20,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {1762#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1755#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:20,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {1762#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1762#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 23:05:20,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1769#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1762#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 23:05:20,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1769#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1769#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-07 23:05:20,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {1776#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1769#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-07 23:05:20,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {1776#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1776#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 23:05:20,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {1531#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1776#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 23:05:20,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {1531#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:20,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1531#true} {1531#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:20,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {1531#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:20,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {1531#true} is VALID [2022-04-07 23:05:20,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#true} is VALID [2022-04-07 23:05:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 23:05:20,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898823272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:05:20,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:05:20,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 21 [2022-04-07 23:05:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83919532] [2022-04-07 23:05:20,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:05:20,606 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-07 23:05:20,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:05:20,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:20,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:20,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-07 23:05:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:05:20,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-07 23:05:20,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2022-04-07 23:05:20,642 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:23,038 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-07 23:05:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 23:05:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-07 23:05:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:05:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-07 23:05:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-07 23:05:23,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 64 transitions. [2022-04-07 23:05:23,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:23,107 INFO L225 Difference]: With dead ends: 102 [2022-04-07 23:05:23,107 INFO L226 Difference]: Without dead ends: 70 [2022-04-07 23:05:23,108 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=421, Invalid=985, Unknown=0, NotChecked=0, Total=1406 [2022-04-07 23:05:23,108 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:05:23,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 59 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 23:05:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-07 23:05:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-07 23:05:23,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:05:23,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:23,185 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:23,185 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:23,186 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-07 23:05:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-07 23:05:23,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:23,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:23,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-07 23:05:23,188 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-07 23:05:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:05:23,189 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-07 23:05:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-07 23:05:23,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:05:23,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:05:23,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:05:23,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:05:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-04-07 23:05:23,193 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 41 [2022-04-07 23:05:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:05:23,193 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-04-07 23:05:23,193 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-07 23:05:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-07 23:05:23,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:05:23,194 INFO L499 BasicCegarLoop]: trace histogram [25, 17, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:05:23,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 23:05:23,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:23,411 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:05:23,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:05:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash 249795404, now seen corresponding path program 5 times [2022-04-07 23:05:23,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:05:23,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31818591] [2022-04-07 23:05:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:05:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:05:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:23,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:05:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:23,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {2257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {2234#true} is VALID [2022-04-07 23:05:23,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {2234#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:23,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2234#true} {2234#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:23,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {2234#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:05:23,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {2234#true} is VALID [2022-04-07 23:05:23,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {2234#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:23,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2234#true} {2234#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:23,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {2234#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:23,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {2234#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2239#(= main_~x~0 0)} is VALID [2022-04-07 23:05:23,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {2239#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2239#(= main_~x~0 0)} is VALID [2022-04-07 23:05:23,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {2239#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:23,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:23,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:23,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:23,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:23,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:23,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:23,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:23,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:23,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:23,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:05:23,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:05:23,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:05:23,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:05:23,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:05:23,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:05:23,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:05:23,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:05:23,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:05:23,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:05:23,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:05:23,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:05:23,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:05:23,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:05:23,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:05:23,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:05:23,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:05:23,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:05:23,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:05:23,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:05:23,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:05:23,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:05:23,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2256#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-07 23:05:23,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {2256#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2256#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-07 23:05:23,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {2256#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:23,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:23,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:23,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {2235#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,788 INFO L272 TraceCheckUtils]: 57: Hoare triple {2235#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2235#false} is VALID [2022-04-07 23:05:23,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {2235#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2235#false} is VALID [2022-04-07 23:05:23,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {2235#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {2235#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 270 proven. 306 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 23:05:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:05:23,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31818591] [2022-04-07 23:05:23,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31818591] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:05:23,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351419830] [2022-04-07 23:05:23,789 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 23:05:23,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:05:23,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:05:23,790 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:05:23,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 23:05:25,651 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2022-04-07 23:05:25,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:05:25,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-07 23:05:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:05:25,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:05:26,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {2234#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:26,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {2234#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {2234#true} is VALID [2022-04-07 23:05:26,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {2234#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:26,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2234#true} {2234#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:26,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {2234#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:26,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {2234#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2239#(= main_~x~0 0)} is VALID [2022-04-07 23:05:26,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {2239#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2239#(= main_~x~0 0)} is VALID [2022-04-07 23:05:26,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {2239#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:26,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:05:26,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {2240#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:26,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:05:26,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {2241#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:26,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:05:26,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {2242#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:26,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:05:26,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {2243#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:26,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:05:26,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {2244#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:05:26,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:05:26,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {2245#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:05:26,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:05:26,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {2246#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:05:26,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:05:26,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {2247#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:05:26,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:05:26,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {2248#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:05:26,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:05:26,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {2249#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:05:26,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:05:26,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {2250#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:05:26,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:05:26,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {2251#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:05:26,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:05:26,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {2252#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:05:26,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:05:26,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {2253#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:05:26,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:05:26,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {2254#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:05:26,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:05:26,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {2255#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2378#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:05:26,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {2378#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2378#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:05:26,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {2378#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:05:26,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {2385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:05:26,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {2385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2392#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 23:05:26,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {2392#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2392#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 23:05:26,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {2392#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2399#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 23:05:26,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {2399#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2399#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 23:05:26,188 INFO L290 TraceCheckUtils]: 47: Hoare triple {2399#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:26,188 INFO L290 TraceCheckUtils]: 48: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:26,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:26,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:26,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:26,189 INFO L290 TraceCheckUtils]: 52: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:26,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:26,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:26,189 INFO L290 TraceCheckUtils]: 55: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:26,189 INFO L290 TraceCheckUtils]: 56: Hoare triple {2235#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:26,190 INFO L272 TraceCheckUtils]: 57: Hoare triple {2235#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2235#false} is VALID [2022-04-07 23:05:26,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {2235#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2235#false} is VALID [2022-04-07 23:05:26,190 INFO L290 TraceCheckUtils]: 59: Hoare triple {2235#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:26,190 INFO L290 TraceCheckUtils]: 60: Hoare triple {2235#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 189 proven. 420 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 23:05:26,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:05:27,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {2235#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:27,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {2235#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:27,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {2235#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2235#false} is VALID [2022-04-07 23:05:27,508 INFO L272 TraceCheckUtils]: 57: Hoare triple {2235#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2235#false} is VALID [2022-04-07 23:05:27,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {2235#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:27,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:27,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:27,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:27,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:27,509 INFO L290 TraceCheckUtils]: 51: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:27,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:27,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {2235#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:27,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {2235#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2235#false} is VALID [2022-04-07 23:05:27,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {2484#(< (mod main_~x~0 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2235#false} is VALID [2022-04-07 23:05:27,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {2488#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2484#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-07 23:05:27,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {2492#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2488#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {2492#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2492#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {2499#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2492#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {2499#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2499#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {2506#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2499#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {2506#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2506#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {2513#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2506#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {2513#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2513#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {2520#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2513#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {2520#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2520#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {2527#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2520#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {2527#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2527#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {2534#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2527#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {2534#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2534#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {2541#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2534#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {2541#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2541#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2541#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2548#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {2555#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2548#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-07 23:05:27,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {2555#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2555#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {2562#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2555#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {2562#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2562#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {2569#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2562#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {2569#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2569#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {2576#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2569#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {2576#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2576#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {2583#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2576#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {2583#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2583#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2583#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2590#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {2597#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2590#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {2597#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2597#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {2604#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2597#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {2604#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2604#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {2611#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2604#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2611#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2611#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2618#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {2625#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2618#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {2625#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2625#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {2234#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2625#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-07 23:05:27,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {2234#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:27,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2234#true} {2234#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:27,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {2234#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:27,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {2234#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {2234#true} is VALID [2022-04-07 23:05:27,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {2234#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#true} is VALID [2022-04-07 23:05:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 189 proven. 420 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 23:05:27,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351419830] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:05:27,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:05:27,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 24] total 47 [2022-04-07 23:05:27,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870750088] [2022-04-07 23:05:27,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:05:27,539 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-07 23:05:27,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:05:27,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:05:27,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:05:27,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-07 23:05:27,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:05:27,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-07 23:05:27,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=1568, Unknown=0, NotChecked=0, Total=2162 [2022-04-07 23:05:27,621 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:01,904 WARN L232 SmtUtils]: Spent 9.24s on a formula simplification. DAG size of input: 156 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 23:07:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:07:02,055 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2022-04-07 23:07:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-07 23:07:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-07 23:07:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:07:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 123 transitions. [2022-04-07 23:07:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 123 transitions. [2022-04-07 23:07:02,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 123 transitions. [2022-04-07 23:07:02,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:07:02,648 INFO L225 Difference]: With dead ends: 148 [2022-04-07 23:07:02,648 INFO L226 Difference]: Without dead ends: 116 [2022-04-07 23:07:02,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 93.6s TimeCoverageRelationStatistics Valid=2026, Invalid=5456, Unknown=0, NotChecked=0, Total=7482 [2022-04-07 23:07:02,650 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-07 23:07:02,650 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 134 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-07 23:07:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-07 23:07:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-07 23:07:02,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:07:02,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:02,821 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:02,821 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:07:02,823 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-04-07 23:07:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-04-07 23:07:02,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:07:02,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:07:02,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-07 23:07:02,824 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 116 states. [2022-04-07 23:07:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:07:02,826 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-04-07 23:07:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-04-07 23:07:02,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:07:02,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:07:02,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:07:02,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:07:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2022-04-07 23:07:02,829 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 61 [2022-04-07 23:07:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:07:02,829 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2022-04-07 23:07:02,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-04-07 23:07:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-07 23:07:02,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:07:02,830 INFO L499 BasicCegarLoop]: trace histogram [47, 39, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:07:02,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-07 23:07:03,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:07:03,034 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:07:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:07:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash -371956704, now seen corresponding path program 6 times [2022-04-07 23:07:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:07:03,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554216257] [2022-04-07 23:07:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:07:03,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:07:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:07:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:07:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:07:03,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {3404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {3359#true} is VALID [2022-04-07 23:07:03,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:03,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3359#true} {3359#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:03,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {3359#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:07:03,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {3404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {3359#true} is VALID [2022-04-07 23:07:03,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:03,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3359#true} {3359#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:03,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {3359#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:03,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {3359#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3364#(= main_~x~0 0)} is VALID [2022-04-07 23:07:03,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {3364#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3364#(= main_~x~0 0)} is VALID [2022-04-07 23:07:03,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {3364#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3365#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:07:03,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {3365#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3365#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 23:07:03,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {3365#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3366#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:07:03,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {3366#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3366#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 23:07:03,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {3366#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3367#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:07:03,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {3367#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3367#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 23:07:03,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {3367#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:07:03,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {3368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 23:07:03,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {3368#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3369#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:07:03,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {3369#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3369#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 23:07:03,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {3369#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3370#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:07:03,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {3370#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3370#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 23:07:03,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {3370#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3371#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:07:03,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {3371#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3371#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 23:07:03,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {3371#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3372#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:07:03,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {3372#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3372#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 23:07:03,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {3372#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3373#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:07:03,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {3373#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3373#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 23:07:03,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {3373#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3374#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:07:03,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {3374#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3374#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 23:07:03,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {3374#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3375#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:07:03,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3375#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 23:07:03,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {3375#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3376#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:07:04,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {3376#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3376#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 23:07:04,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {3376#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3377#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:07:04,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {3377#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3377#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 23:07:04,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {3377#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3378#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:07:04,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {3378#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3378#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 23:07:04,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {3378#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3379#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:07:04,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {3379#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3379#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 23:07:04,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {3379#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:07:04,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {3380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 23:07:04,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {3380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3381#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:07:04,004 INFO L290 TraceCheckUtils]: 40: Hoare triple {3381#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3381#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 23:07:04,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {3381#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3382#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 23:07:04,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {3382#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3382#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 23:07:04,005 INFO L290 TraceCheckUtils]: 43: Hoare triple {3382#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3383#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:07:04,005 INFO L290 TraceCheckUtils]: 44: Hoare triple {3383#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3383#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 23:07:04,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {3383#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3384#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 23:07:04,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {3384#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3384#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 23:07:04,007 INFO L290 TraceCheckUtils]: 47: Hoare triple {3384#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3385#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 23:07:04,007 INFO L290 TraceCheckUtils]: 48: Hoare triple {3385#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3385#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 23:07:04,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {3385#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3386#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 23:07:04,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {3386#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3386#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 23:07:04,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {3386#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3387#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 23:07:04,009 INFO L290 TraceCheckUtils]: 52: Hoare triple {3387#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3387#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 23:07:04,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {3387#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3388#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 23:07:04,010 INFO L290 TraceCheckUtils]: 54: Hoare triple {3388#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3388#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 23:07:04,010 INFO L290 TraceCheckUtils]: 55: Hoare triple {3388#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3389#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 23:07:04,010 INFO L290 TraceCheckUtils]: 56: Hoare triple {3389#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3389#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 23:07:04,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {3389#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 23:07:04,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {3390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 23:07:04,012 INFO L290 TraceCheckUtils]: 59: Hoare triple {3390#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3391#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 23:07:04,012 INFO L290 TraceCheckUtils]: 60: Hoare triple {3391#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3391#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 23:07:04,013 INFO L290 TraceCheckUtils]: 61: Hoare triple {3391#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3392#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 23:07:04,013 INFO L290 TraceCheckUtils]: 62: Hoare triple {3392#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3392#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 23:07:04,013 INFO L290 TraceCheckUtils]: 63: Hoare triple {3392#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3393#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-07 23:07:04,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {3393#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3393#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-07 23:07:04,014 INFO L290 TraceCheckUtils]: 65: Hoare triple {3393#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3394#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 23:07:04,015 INFO L290 TraceCheckUtils]: 66: Hoare triple {3394#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3394#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 23:07:04,015 INFO L290 TraceCheckUtils]: 67: Hoare triple {3394#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3395#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-07 23:07:04,015 INFO L290 TraceCheckUtils]: 68: Hoare triple {3395#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3395#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-07 23:07:04,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {3395#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3396#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 23:07:04,016 INFO L290 TraceCheckUtils]: 70: Hoare triple {3396#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3396#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 23:07:04,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {3396#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3397#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-07 23:07:04,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {3397#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3397#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-07 23:07:04,017 INFO L290 TraceCheckUtils]: 73: Hoare triple {3397#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3398#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 23:07:04,018 INFO L290 TraceCheckUtils]: 74: Hoare triple {3398#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3398#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 23:07:04,018 INFO L290 TraceCheckUtils]: 75: Hoare triple {3398#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3399#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-07 23:07:04,019 INFO L290 TraceCheckUtils]: 76: Hoare triple {3399#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3399#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-07 23:07:04,019 INFO L290 TraceCheckUtils]: 77: Hoare triple {3399#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3400#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 23:07:04,019 INFO L290 TraceCheckUtils]: 78: Hoare triple {3400#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3400#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 23:07:04,020 INFO L290 TraceCheckUtils]: 79: Hoare triple {3400#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3401#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-07 23:07:04,020 INFO L290 TraceCheckUtils]: 80: Hoare triple {3401#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3401#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-07 23:07:04,021 INFO L290 TraceCheckUtils]: 81: Hoare triple {3401#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 23:07:04,021 INFO L290 TraceCheckUtils]: 82: Hoare triple {3402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 23:07:04,022 INFO L290 TraceCheckUtils]: 83: Hoare triple {3402#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3403#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:07:04,022 INFO L290 TraceCheckUtils]: 84: Hoare triple {3403#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3403#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:07:04,022 INFO L290 TraceCheckUtils]: 85: Hoare triple {3403#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3360#false} is VALID [2022-04-07 23:07:04,022 INFO L290 TraceCheckUtils]: 86: Hoare triple {3360#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 87: Hoare triple {3360#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 88: Hoare triple {3360#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 89: Hoare triple {3360#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 90: Hoare triple {3360#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 91: Hoare triple {3360#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 92: Hoare triple {3360#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 93: Hoare triple {3360#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 94: Hoare triple {3360#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 95: Hoare triple {3360#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 96: Hoare triple {3360#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 97: Hoare triple {3360#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 98: Hoare triple {3360#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 99: Hoare triple {3360#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 100: Hoare triple {3360#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L272 TraceCheckUtils]: 101: Hoare triple {3360#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3360#false} is VALID [2022-04-07 23:07:04,023 INFO L290 TraceCheckUtils]: 102: Hoare triple {3360#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3360#false} is VALID [2022-04-07 23:07:04,024 INFO L290 TraceCheckUtils]: 103: Hoare triple {3360#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,024 INFO L290 TraceCheckUtils]: 104: Hoare triple {3360#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 600 proven. 1560 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 23:07:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:07:04,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554216257] [2022-04-07 23:07:04,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554216257] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:07:04,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849018940] [2022-04-07 23:07:04,025 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 23:07:04,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:07:04,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:07:04,027 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:07:04,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 23:07:06,028 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2022-04-07 23:07:06,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:07:06,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 23:07:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:07:06,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:07:06,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {3359#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3359#true} {3359#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {3359#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {3359#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 46: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 55: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 63: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 70: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 74: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 75: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 76: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 77: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 78: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 79: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,689 INFO L290 TraceCheckUtils]: 81: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:06,690 INFO L290 TraceCheckUtils]: 82: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:06,692 INFO L290 TraceCheckUtils]: 83: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3657#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,692 INFO L290 TraceCheckUtils]: 84: Hoare triple {3657#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3657#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,693 INFO L290 TraceCheckUtils]: 85: Hoare triple {3657#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3664#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,693 INFO L290 TraceCheckUtils]: 86: Hoare triple {3664#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3664#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,694 INFO L290 TraceCheckUtils]: 87: Hoare triple {3664#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3671#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,694 INFO L290 TraceCheckUtils]: 88: Hoare triple {3671#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3671#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,695 INFO L290 TraceCheckUtils]: 89: Hoare triple {3671#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3678#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,696 INFO L290 TraceCheckUtils]: 90: Hoare triple {3678#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3678#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,702 INFO L290 TraceCheckUtils]: 91: Hoare triple {3678#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3685#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,703 INFO L290 TraceCheckUtils]: 92: Hoare triple {3685#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3685#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,704 INFO L290 TraceCheckUtils]: 93: Hoare triple {3685#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3692#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,704 INFO L290 TraceCheckUtils]: 94: Hoare triple {3692#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3692#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,705 INFO L290 TraceCheckUtils]: 95: Hoare triple {3692#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3699#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,705 INFO L290 TraceCheckUtils]: 96: Hoare triple {3699#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3699#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,706 INFO L290 TraceCheckUtils]: 97: Hoare triple {3699#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3706#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,706 INFO L290 TraceCheckUtils]: 98: Hoare triple {3706#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3706#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} is VALID [2022-04-07 23:07:06,710 INFO L290 TraceCheckUtils]: 99: Hoare triple {3706#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3713#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ main_~x~0 4294967279) 4294967296) 10000000))} is VALID [2022-04-07 23:07:06,711 INFO L290 TraceCheckUtils]: 100: Hoare triple {3713#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ main_~x~0 4294967279) 4294967296) 10000000))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:06,711 INFO L272 TraceCheckUtils]: 101: Hoare triple {3360#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3360#false} is VALID [2022-04-07 23:07:06,711 INFO L290 TraceCheckUtils]: 102: Hoare triple {3360#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3360#false} is VALID [2022-04-07 23:07:06,711 INFO L290 TraceCheckUtils]: 103: Hoare triple {3360#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:06,711 INFO L290 TraceCheckUtils]: 104: Hoare triple {3360#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 663 proven. 64 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2022-04-07 23:07:06,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:07:09,158 INFO L290 TraceCheckUtils]: 104: Hoare triple {3360#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:09,159 INFO L290 TraceCheckUtils]: 103: Hoare triple {3732#(not (<= __VERIFIER_assert_~cond 0))} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3360#false} is VALID [2022-04-07 23:07:09,159 INFO L290 TraceCheckUtils]: 102: Hoare triple {3736#(< 0 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3732#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:07:09,160 INFO L272 TraceCheckUtils]: 101: Hoare triple {3740#(= (mod main_~x~0 2) 0)} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3736#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:07:09,160 INFO L290 TraceCheckUtils]: 100: Hoare triple {3744#(or (< (mod main_~x~0 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3740#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 23:07:09,161 INFO L290 TraceCheckUtils]: 99: Hoare triple {3748#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3744#(or (< (mod main_~x~0 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,161 INFO L290 TraceCheckUtils]: 98: Hoare triple {3752#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3748#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,162 INFO L290 TraceCheckUtils]: 97: Hoare triple {3756#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3752#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,162 INFO L290 TraceCheckUtils]: 96: Hoare triple {3756#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3756#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,172 INFO L290 TraceCheckUtils]: 95: Hoare triple {3763#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3756#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,172 INFO L290 TraceCheckUtils]: 94: Hoare triple {3763#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3763#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 23:07:09,173 INFO L290 TraceCheckUtils]: 93: Hoare triple {3770#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3763#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 23:07:09,174 INFO L290 TraceCheckUtils]: 92: Hoare triple {3770#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3770#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,175 INFO L290 TraceCheckUtils]: 91: Hoare triple {3777#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3770#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,175 INFO L290 TraceCheckUtils]: 90: Hoare triple {3777#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3777#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,176 INFO L290 TraceCheckUtils]: 89: Hoare triple {3784#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3777#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,176 INFO L290 TraceCheckUtils]: 88: Hoare triple {3784#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3784#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,177 INFO L290 TraceCheckUtils]: 87: Hoare triple {3791#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3784#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,178 INFO L290 TraceCheckUtils]: 86: Hoare triple {3791#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3791#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,189 INFO L290 TraceCheckUtils]: 85: Hoare triple {3798#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3791#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,189 INFO L290 TraceCheckUtils]: 84: Hoare triple {3798#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3798#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 83: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3798#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 82: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 81: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 80: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 77: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 76: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 75: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 74: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 73: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,190 INFO L290 TraceCheckUtils]: 72: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 71: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 70: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 69: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 68: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 67: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 66: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 65: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 64: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 63: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 62: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 61: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 59: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 43: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 41: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {3359#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {3359#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {3359#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3359#true} is VALID [2022-04-07 23:07:09,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {3359#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3359#true} {3359#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {3359#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {3359#true} is VALID [2022-04-07 23:07:09,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {3359#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3359#true} is VALID [2022-04-07 23:07:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 663 proven. 64 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2022-04-07 23:07:09,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849018940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:07:09,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:07:09,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 11, 15] total 65 [2022-04-07 23:07:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362994318] [2022-04-07 23:07:09,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:07:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-07 23:07:09,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:07:09,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:09,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:07:09,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-07 23:07:09,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:07:09,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-07 23:07:09,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=935, Invalid=3225, Unknown=0, NotChecked=0, Total=4160 [2022-04-07 23:07:09,344 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:07:21,042 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2022-04-07 23:07:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-07 23:07:21,043 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-07 23:07:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:07:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2022-04-07 23:07:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2022-04-07 23:07:21,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 130 transitions. [2022-04-07 23:07:21,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:07:21,591 INFO L225 Difference]: With dead ends: 165 [2022-04-07 23:07:21,591 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 23:07:21,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2162, Invalid=11644, Unknown=0, NotChecked=0, Total=13806 [2022-04-07 23:07:21,594 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 145 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:07:21,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 94 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 23:07:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 23:07:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 23:07:21,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:07:21,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:07:21,595 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:07:21,595 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:07:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:07:21,595 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:07:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:07:21,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:07:21,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:07:21,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:07:21,595 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:07:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:07:21,595 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:07:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:07:21,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:07:21,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:07:21,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:07:21,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:07:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:07:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 23:07:21,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-04-07 23:07:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:07:21,596 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 23:07:21,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:07:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:07:21,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:07:21,598 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:07:21,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-07 23:07:21,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:07:21,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 23:07:24,346 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 23:07:24,346 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 5 18) the Hoare annotation is: true [2022-04-07 23:07:24,346 INFO L878 garLoopResultBuilder]: At program point L9-2(lines 8 14) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000) (= (mod main_~x~0 2) 0)) [2022-04-07 23:07:24,346 INFO L878 garLoopResultBuilder]: At program point L8-2(lines 8 14) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point L9(lines 9 13) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 5 18) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 5 18) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point L4(line 4) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point L4-1(line 4) no Hoare annotation was computed. [2022-04-07 23:07:24,346 INFO L882 garLoopResultBuilder]: For program point L4-3(line 4) no Hoare annotation was computed. [2022-04-07 23:07:24,347 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2022-04-07 23:07:24,347 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2022-04-07 23:07:24,348 INFO L719 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-04-07 23:07:24,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:07:24,355 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:07:24,356 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-04-07 23:07:24,356 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:07:24,358 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:07:24,358 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 23:07:24,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:07:24 BasicIcfg [2022-04-07 23:07:24,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 23:07:24,365 INFO L158 Benchmark]: Toolchain (without parser) took 132329.01ms. Allocated memory was 203.4MB in the beginning and 275.8MB in the end (delta: 72.4MB). Free memory was 145.1MB in the beginning and 93.8MB in the end (delta: 51.3MB). Peak memory consumption was 136.8MB. Max. memory is 8.0GB. [2022-04-07 23:07:24,365 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 203.4MB. Free memory was 161.5MB in the beginning and 161.4MB in the end (delta: 72.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:07:24,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.11ms. Allocated memory was 203.4MB in the beginning and 275.8MB in the end (delta: 72.4MB). Free memory was 145.0MB in the beginning and 247.5MB in the end (delta: -102.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-07 23:07:24,365 INFO L158 Benchmark]: Boogie Preprocessor took 21.19ms. Allocated memory is still 275.8MB. Free memory was 247.5MB in the beginning and 246.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:07:24,365 INFO L158 Benchmark]: RCFGBuilder took 180.94ms. Allocated memory is still 275.8MB. Free memory was 246.0MB in the beginning and 235.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 23:07:24,366 INFO L158 Benchmark]: IcfgTransformer took 23.60ms. Allocated memory is still 275.8MB. Free memory was 235.5MB in the beginning and 233.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 23:07:24,366 INFO L158 Benchmark]: TraceAbstraction took 131943.02ms. Allocated memory is still 275.8MB. Free memory was 233.4MB in the beginning and 93.8MB in the end (delta: 139.6MB). Peak memory consumption was 153.2MB. Max. memory is 8.0GB. [2022-04-07 23:07:24,367 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.08ms. Allocated memory is still 203.4MB. Free memory was 161.5MB in the beginning and 161.4MB in the end (delta: 72.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 154.11ms. Allocated memory was 203.4MB in the beginning and 275.8MB in the end (delta: 72.4MB). Free memory was 145.0MB in the beginning and 247.5MB in the end (delta: -102.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.19ms. Allocated memory is still 275.8MB. Free memory was 247.5MB in the beginning and 246.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 180.94ms. Allocated memory is still 275.8MB. Free memory was 246.0MB in the beginning and 235.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 23.60ms. Allocated memory is still 275.8MB. Free memory was 235.5MB in the beginning and 233.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 131943.02ms. Allocated memory is still 275.8MB. Free memory was 233.4MB in the beginning and 93.8MB in the end (delta: 139.6MB). Peak memory consumption was 153.2MB. 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 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 131.9s, OverallIterations: 9, TraceHistogramMax: 47, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 113.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 496 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 797 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3831 IncrementalHoareTripleChecker+Invalid, 4628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 797 mSolverCounterUnsat, 107 mSDtfsCounter, 3831 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 846 GetRequests, 515 SyntacticMatches, 12 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2741 ImplicationChecksByTransitivity, 106.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=8, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 81 NumberOfFragments, 29 HoareAnnotationTreeSize, 17 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12699 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 588 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 3842 SizeOfPredicates, 6 NumberOfNonLiveVariables, 713 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 6330/9447 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 10000000 || x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-07 23:07:24,381 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...