/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/loopv3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:07:01,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:07:01,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:07:01,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:07:01,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:07:01,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:07:01,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:07:01,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:07:01,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:07:01,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:07:01,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:07:01,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:07:01,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:07:01,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:07:01,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:07:01,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:07:01,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:07:01,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:07:01,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:07:01,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:07:01,619 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:07:01,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:07:01,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:07:01,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:07:01,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:07:01,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:07:01,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:07:01,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:07:01,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:07:01,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:07:01,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:07:01,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:07:01,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:07:01,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:07:01,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:07:01,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:07:01,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:07:01,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:07:01,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:07:01,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:07:01,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:07:01,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:07:01,633 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:07:01,659 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:07:01,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:07:01,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:07:01,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:07:01,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:07:01,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:07:01,660 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:07:01,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:07:01,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:07:01,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:07:01,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:07:01,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:07:01,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:07:01,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:07:01,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:07:01,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:07:01,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:07:01,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:07:01,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:07:01,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:07:01,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:07:01,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:07:01,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:07:01,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:07:01,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:07:01,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:07:01,662 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:07:01,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:07:01,662 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:07:01,662 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 22:07:01,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:07:01,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:07:01,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:07:01,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:07:01,863 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:07:01,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-27 22:07:01,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a3897256/04fadf42d96c435daf1b1a5d9db8bdcb/FLAGce9f3d0b9 [2022-04-27 22:07:02,269 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:07:02,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-27 22:07:02,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a3897256/04fadf42d96c435daf1b1a5d9db8bdcb/FLAGce9f3d0b9 [2022-04-27 22:07:02,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a3897256/04fadf42d96c435daf1b1a5d9db8bdcb [2022-04-27 22:07:02,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:07:02,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:07:02,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:07:02,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:07:02,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:07:02,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51aa3b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02, skipping insertion in model container [2022-04-27 22:07:02,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:07:02,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:07:02,453 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/loopv3.c[456,469] [2022-04-27 22:07:02,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:07:02,474 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:07:02,481 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/loopv3.c[456,469] [2022-04-27 22:07:02,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:07:02,496 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:07:02,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02 WrapperNode [2022-04-27 22:07:02,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:07:02,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:07:02,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:07:02,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:07:02,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:07:02,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:07:02,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:07:02,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:07:02,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:07:02,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:07:02,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:07:02,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:07:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:07:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:07:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:07:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:07:02,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:07:02,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:07:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:07:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:07:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:07:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:07:02,617 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:07:02,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:07:02,724 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:07:02,729 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:07:02,740 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:07:02,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:07:02 BoogieIcfgContainer [2022-04-27 22:07:02,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:07:02,742 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:07:02,743 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:07:02,744 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:07:02,748 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:07:02" (1/1) ... [2022-04-27 22:07:02,749 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:07:02,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:07:02 BasicIcfg [2022-04-27 22:07:02,776 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:07:02,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:07:02,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:07:02,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:07:02,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:07:02" (1/4) ... [2022-04-27 22:07:02,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e1cb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:07:02, skipping insertion in model container [2022-04-27 22:07:02,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:07:02" (2/4) ... [2022-04-27 22:07:02,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e1cb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:07:02, skipping insertion in model container [2022-04-27 22:07:02,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:07:02" (3/4) ... [2022-04-27 22:07:02,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e1cb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:07:02, skipping insertion in model container [2022-04-27 22:07:02,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:07:02" (4/4) ... [2022-04-27 22:07:02,781 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv3.cqvasr [2022-04-27 22:07:02,790 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:07:02,791 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:07:02,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:07:02,822 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5209bc6f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77625910 [2022-04-27 22:07:02,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:07:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 22:07:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:07:02,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:07:02,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:07:02,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:07:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:07:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1479494173, now seen corresponding path program 1 times [2022-04-27 22:07:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:07:02,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39096395] [2022-04-27 22:07:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:07:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:07:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:02,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:07:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:02,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 22:07:02,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 22:07:02,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 22:07:02,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:07:02,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 22:07:02,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 22:07:02,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 22:07:02,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 22:07:02,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {24#true} is VALID [2022-04-27 22:07:02,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [61] L25-2-->L23-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 22:07:02,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {25#false} is VALID [2022-04-27 22:07:02,969 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {25#false} is VALID [2022-04-27 22:07:02,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 22:07:02,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 22:07:02,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 22:07:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:07:02,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39096395] [2022-04-27 22:07:02,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39096395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:07:02,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:07:02,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:07:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054982900] [2022-04-27 22:07:02,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:07:02,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 22:07:02,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:07:02,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:03,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:07:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:07:03,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:07:03,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:07:03,026 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:03,095 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 22:07:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:07:03,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 22:07:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:07:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 22:07:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 22:07:03,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-27 22:07:03,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:03,147 INFO L225 Difference]: With dead ends: 34 [2022-04-27 22:07:03,147 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 22:07:03,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:07:03,151 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:07:03,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:07:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 22:07:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 22:07:03,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:07:03,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,176 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,176 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:03,178 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 22:07:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 22:07:03,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:03,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:03,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 22:07:03,179 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 22:07:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:03,181 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 22:07:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 22:07:03,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:03,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:03,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:07:03,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:07:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 22:07:03,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2022-04-27 22:07:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:07:03,183 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 22:07:03,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 22:07:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:07:03,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:07:03,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:07:03,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:07:03,185 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:07:03,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:07:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1508123324, now seen corresponding path program 1 times [2022-04-27 22:07:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:07:03,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457283393] [2022-04-27 22:07:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:07:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:07:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:07:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:03,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {129#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129#(<= 50000001 ~SIZE~0)} {124#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {124#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:07:03,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {129#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129#(<= 50000001 ~SIZE~0)} {124#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {129#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {130#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:03,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {130#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-27 22:07:03,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {125#false} is VALID [2022-04-27 22:07:03,261 INFO L272 TraceCheckUtils]: 8: Hoare triple {125#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {125#false} is VALID [2022-04-27 22:07:03,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {125#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {125#false} is VALID [2022-04-27 22:07:03,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {125#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-27 22:07:03,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {125#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-27 22:07:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:03,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:07:03,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457283393] [2022-04-27 22:07:03,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457283393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:07:03,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:07:03,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 22:07:03,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777202141] [2022-04-27 22:07:03,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:07:03,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-27 22:07:03,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:07:03,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:03,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:07:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:07:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:07:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:07:03,275 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:03,367 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 22:07:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:07:03,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-27 22:07:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:07:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 22:07:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 22:07:03,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-27 22:07:03,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:03,397 INFO L225 Difference]: With dead ends: 22 [2022-04-27 22:07:03,398 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 22:07:03,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 22:07:03,401 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:07:03,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:07:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 22:07:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 22:07:03,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:07:03,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,411 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,411 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:03,413 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 22:07:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 22:07:03,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:03,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:03,414 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 16 states. [2022-04-27 22:07:03,415 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 16 states. [2022-04-27 22:07:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:03,416 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 22:07:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 22:07:03,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:03,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:03,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:07:03,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:07:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 22:07:03,419 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 22:07:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:07:03,419 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 22:07:03,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 22:07:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 22:07:03,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:07:03,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:07:03,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:07:03,421 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:07:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:07:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash 89998238, now seen corresponding path program 1 times [2022-04-27 22:07:03,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:07:03,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948359988] [2022-04-27 22:07:03,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:07:03,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:07:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:07:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:03,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {230#(<= 50000001 ~SIZE~0)} {225#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:07:03,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230#(<= 50000001 ~SIZE~0)} {225#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {231#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:03,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {231#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:03,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {232#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 22:07:03,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {232#(<= (+ main_~i~0 49999993) ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 22:07:03,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {226#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {226#false} is VALID [2022-04-27 22:07:03,551 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {226#false} is VALID [2022-04-27 22:07:03,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#false} is VALID [2022-04-27 22:07:03,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 22:07:03,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 22:07:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:03,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:07:03,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948359988] [2022-04-27 22:07:03,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948359988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:07:03,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129657750] [2022-04-27 22:07:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:07:03,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:07:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:07:03,561 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:07:03,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:07:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:03,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 22:07:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:03,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:07:03,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-27 22:07:03,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230#(<= 50000001 ~SIZE~0)} {225#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:03,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {252#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:03,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {252#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {252#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:03,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {252#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {259#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:03,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 22:07:03,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {226#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {226#false} is VALID [2022-04-27 22:07:03,755 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {226#false} is VALID [2022-04-27 22:07:03,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#false} is VALID [2022-04-27 22:07:03,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 22:07:03,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 22:07:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:03,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:07:03,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 22:07:03,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 22:07:03,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#false} is VALID [2022-04-27 22:07:03,846 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {226#false} is VALID [2022-04-27 22:07:03,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {226#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {226#false} is VALID [2022-04-27 22:07:03,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#(< main_~i~0 ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-27 22:07:03,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(< (+ main_~i~0 8) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {293#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-27 22:07:03,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {297#(< (+ main_~i~0 8) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {297#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 22:07:03,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {304#(< 8 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {297#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 22:07:03,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#(< 8 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {304#(< 8 ~SIZE~0)} is VALID [2022-04-27 22:07:03,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#(< 8 ~SIZE~0)} {225#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {304#(< 8 ~SIZE~0)} is VALID [2022-04-27 22:07:03,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#(< 8 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {304#(< 8 ~SIZE~0)} is VALID [2022-04-27 22:07:03,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {304#(< 8 ~SIZE~0)} is VALID [2022-04-27 22:07:03,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-27 22:07:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:03,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129657750] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:07:03,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:07:03,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-27 22:07:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184190716] [2022-04-27 22:07:03,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:07:03,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-27 22:07:03,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:07:03,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:03,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:03,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 22:07:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:07:03,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 22:07:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:07:03,874 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:04,068 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 22:07:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 22:07:04,068 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-27 22:07:04,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:07:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-27 22:07:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-27 22:07:04,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2022-04-27 22:07:04,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:04,098 INFO L225 Difference]: With dead ends: 27 [2022-04-27 22:07:04,098 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 22:07:04,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-04-27 22:07:04,101 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:07:04,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 17 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:07:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 22:07:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 22:07:04,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:07:04,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:04,112 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:04,112 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:04,114 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-27 22:07:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 22:07:04,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:04,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:04,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 21 states. [2022-04-27 22:07:04,114 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 21 states. [2022-04-27 22:07:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:04,115 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-27 22:07:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 22:07:04,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:04,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:04,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:07:04,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:07:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-27 22:07:04,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-04-27 22:07:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:07:04,121 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-27 22:07:04,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 22:07:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 22:07:04,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:07:04,122 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:07:04,141 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-27 22:07:04,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:07:04,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:07:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:07:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1261632700, now seen corresponding path program 2 times [2022-04-27 22:07:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:07:04,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200585634] [2022-04-27 22:07:04,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:07:04,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:07:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:04,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:07:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:04,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {457#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {451#(<= 50000001 ~SIZE~0)} {446#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {446#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:07:04,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {451#(<= 50000001 ~SIZE~0)} {446#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {451#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {452#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {452#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {453#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 22:07:04,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {453#(<= (+ main_~i~0 49999993) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {453#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 22:07:04,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {453#(<= (+ main_~i~0 49999993) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {454#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 22:07:04,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {454#(<= (+ main_~i~0 49999985) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {454#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 22:07:04,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {454#(<= (+ main_~i~0 49999985) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {455#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 22:07:04,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {455#(<= (+ main_~i~0 49999977) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {455#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 22:07:04,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(<= (+ main_~i~0 49999977) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {456#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:04,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 22:07:04,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {447#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {447#false} is VALID [2022-04-27 22:07:04,438 INFO L272 TraceCheckUtils]: 16: Hoare triple {447#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {447#false} is VALID [2022-04-27 22:07:04,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {447#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {447#false} is VALID [2022-04-27 22:07:04,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {447#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 22:07:04,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {447#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 22:07:04,438 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-27 22:07:04,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:07:04,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200585634] [2022-04-27 22:07:04,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200585634] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:07:04,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528957113] [2022-04-27 22:07:04,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 22:07:04,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:07:04,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:07:04,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:07:04,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 22:07:04,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 22:07:04,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:07:04,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 22:07:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:04,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:07:04,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {446#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {446#true} is VALID [2022-04-27 22:07:04,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {451#(<= 50000001 ~SIZE~0)} {446#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {451#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:04,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {476#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {476#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {476#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {476#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {483#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {483#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {483#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {490#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {490#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {490#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {490#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {497#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {497#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {497#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {504#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:04,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {504#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 22:07:04,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {447#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {447#false} is VALID [2022-04-27 22:07:04,692 INFO L272 TraceCheckUtils]: 16: Hoare triple {447#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {447#false} is VALID [2022-04-27 22:07:04,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {447#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {447#false} is VALID [2022-04-27 22:07:04,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {447#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 22:07:04,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {447#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 22:07:04,693 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-27 22:07:04,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:07:04,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {447#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 22:07:04,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {447#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 22:07:04,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {447#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {447#false} is VALID [2022-04-27 22:07:04,847 INFO L272 TraceCheckUtils]: 16: Hoare triple {447#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {447#false} is VALID [2022-04-27 22:07:04,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {447#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {447#false} is VALID [2022-04-27 22:07:04,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#(< main_~i~0 ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {447#false} is VALID [2022-04-27 22:07:04,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#(< (+ main_~i~0 8) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {538#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-27 22:07:04,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {542#(< (+ main_~i~0 8) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {542#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 22:07:04,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {549#(< (+ main_~i~0 16) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {542#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 22:07:04,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {549#(< (+ main_~i~0 16) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {549#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 22:07:04,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#(< (+ main_~i~0 24) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {549#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 22:07:04,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#(< (+ main_~i~0 24) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {556#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 22:07:04,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(< (+ 32 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {556#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 22:07:04,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(< (+ 32 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {563#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:04,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {570#(< 32 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {563#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:04,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {570#(< 32 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(< 32 ~SIZE~0)} is VALID [2022-04-27 22:07:04,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570#(< 32 ~SIZE~0)} {446#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(< 32 ~SIZE~0)} is VALID [2022-04-27 22:07:04,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {570#(< 32 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(< 32 ~SIZE~0)} is VALID [2022-04-27 22:07:04,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {570#(< 32 ~SIZE~0)} is VALID [2022-04-27 22:07:04,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {446#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {446#true} is VALID [2022-04-27 22:07:04,861 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-27 22:07:04,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528957113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:07:04,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:07:04,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-04-27 22:07:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313689240] [2022-04-27 22:07:04,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:07:04,862 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-27 22:07:04,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:07:04,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:04,892 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-27 22:07:04,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 22:07:04,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:07:04,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 22:07:04,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-27 22:07:04,894 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:05,332 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 22:07:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 22:07:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-27 22:07:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:07:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-27 22:07:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-27 22:07:05,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 54 transitions. [2022-04-27 22:07:05,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:05,380 INFO L225 Difference]: With dead ends: 39 [2022-04-27 22:07:05,380 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 22:07:05,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2022-04-27 22:07:05,381 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:07:05,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 21 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 22:07:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 22:07:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 22:07:05,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:07:05,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:05,396 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:05,396 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:05,398 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 22:07:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 22:07:05,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:05,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:05,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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-27 22:07:05,398 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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-27 22:07:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:05,400 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 22:07:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 22:07:05,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:05,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:05,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:07:05,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:07:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-27 22:07:05,401 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2022-04-27 22:07:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:07:05,401 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-27 22:07:05,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 22:07:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 22:07:05,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:07:05,402 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:07:05,418 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-27 22:07:05,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 22:07:05,615 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:07:05,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:07:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1413178640, now seen corresponding path program 3 times [2022-04-27 22:07:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:07:05,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188868053] [2022-04-27 22:07:05,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:07:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:07:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:07:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:05,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {801#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:05,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:05,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {789#(<= 50000001 ~SIZE~0)} {784#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:05,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {801#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:07:05,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {801#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:05,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {789#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:05,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {789#(<= 50000001 ~SIZE~0)} {784#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:05,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {789#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:05,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {789#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {790#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:05,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {790#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:05,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {791#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 22:07:05,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {791#(<= (+ main_~i~0 49999993) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {791#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 22:07:05,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {791#(<= (+ main_~i~0 49999993) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {792#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 22:07:05,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {792#(<= (+ main_~i~0 49999985) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {792#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 22:07:05,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {792#(<= (+ main_~i~0 49999985) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {793#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 22:07:05,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {793#(<= (+ main_~i~0 49999977) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {793#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 22:07:05,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {793#(<= (+ main_~i~0 49999977) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {794#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:05,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {794#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {794#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:05,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {794#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {795#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 22:07:05,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {795#(<= (+ main_~i~0 49999961) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {795#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 22:07:05,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {795#(<= (+ main_~i~0 49999961) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {796#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:05,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {796#(<= (+ 49999953 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {796#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:05,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {796#(<= (+ 49999953 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {797#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:05,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {797#(<= (+ 49999945 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {797#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:05,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {797#(<= (+ 49999945 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {798#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 22:07:05,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {798#(<= (+ main_~i~0 49999937) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {798#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 22:07:05,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {798#(<= (+ main_~i~0 49999937) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {799#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:05,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {799#(<= (+ 49999929 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {799#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:05,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {799#(<= (+ 49999929 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {800#(<= (+ 49999921 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:05,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#(<= (+ 49999921 main_~i~0) ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-27 22:07:05,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {785#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {785#false} is VALID [2022-04-27 22:07:05,804 INFO L272 TraceCheckUtils]: 28: Hoare triple {785#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {785#false} is VALID [2022-04-27 22:07:05,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {785#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {785#false} is VALID [2022-04-27 22:07:05,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {785#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-27 22:07:05,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {785#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-27 22:07:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:05,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:07:05,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188868053] [2022-04-27 22:07:05,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188868053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:07:05,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204985235] [2022-04-27 22:07:05,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 22:07:05,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:07:05,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:07:05,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:07:05,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 22:07:05,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 22:07:05,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:07:05,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 22:07:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:05,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:07:06,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-27 22:07:06,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:06,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {789#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:06,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {789#(<= 50000001 ~SIZE~0)} {784#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:06,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {789#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:06,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {789#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {820#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {820#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {820#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {820#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {827#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {827#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {827#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {834#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {834#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {841#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {841#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {841#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {841#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {848#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {848#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {848#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {848#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {855#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {855#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {855#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {855#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {862#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {862#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {862#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {862#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {869#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {869#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {869#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {869#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {876#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {876#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {876#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {876#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {883#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {883#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {883#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {883#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {890#(and (<= main_~i~0 80) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:06,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {890#(and (<= main_~i~0 80) (<= 50000001 ~SIZE~0))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-27 22:07:06,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {785#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {785#false} is VALID [2022-04-27 22:07:06,235 INFO L272 TraceCheckUtils]: 28: Hoare triple {785#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {785#false} is VALID [2022-04-27 22:07:06,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {785#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {785#false} is VALID [2022-04-27 22:07:06,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {785#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-27 22:07:06,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {785#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-27 22:07:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:06,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:07:06,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {785#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-27 22:07:06,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {785#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-27 22:07:06,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {785#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {785#false} is VALID [2022-04-27 22:07:06,636 INFO L272 TraceCheckUtils]: 28: Hoare triple {785#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {785#false} is VALID [2022-04-27 22:07:06,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {785#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {785#false} is VALID [2022-04-27 22:07:06,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {924#(< main_~i~0 ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-27 22:07:06,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {928#(< (+ main_~i~0 8) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {924#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-27 22:07:06,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {928#(< (+ main_~i~0 8) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {928#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 22:07:06,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {935#(< (+ main_~i~0 16) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {928#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 22:07:06,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {935#(< (+ main_~i~0 16) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {935#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 22:07:06,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {942#(< (+ main_~i~0 24) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {935#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 22:07:06,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#(< (+ main_~i~0 24) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {942#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 22:07:06,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {949#(< (+ 32 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {942#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 22:07:06,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {949#(< (+ 32 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {949#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {956#(< (+ 40 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {949#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#(< (+ 40 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {956#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {963#(< (+ main_~i~0 48) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {956#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {963#(< (+ main_~i~0 48) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {963#(< (+ main_~i~0 48) ~SIZE~0)} is VALID [2022-04-27 22:07:06,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {970#(< (+ 56 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {963#(< (+ main_~i~0 48) ~SIZE~0)} is VALID [2022-04-27 22:07:06,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {970#(< (+ 56 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {970#(< (+ 56 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {977#(< (+ 64 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {970#(< (+ 56 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {977#(< (+ 64 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {977#(< (+ 64 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {984#(< (+ 72 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {977#(< (+ 64 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {984#(< (+ 72 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {984#(< (+ 72 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {991#(< (+ main_~i~0 80) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {984#(< (+ 72 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:06,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {991#(< (+ main_~i~0 80) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {991#(< (+ main_~i~0 80) ~SIZE~0)} is VALID [2022-04-27 22:07:06,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {998#(< 80 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {991#(< (+ main_~i~0 80) ~SIZE~0)} is VALID [2022-04-27 22:07:06,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {998#(< 80 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#(< 80 ~SIZE~0)} is VALID [2022-04-27 22:07:06,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {998#(< 80 ~SIZE~0)} {784#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#(< 80 ~SIZE~0)} is VALID [2022-04-27 22:07:06,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#(< 80 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#(< 80 ~SIZE~0)} is VALID [2022-04-27 22:07:06,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {998#(< 80 ~SIZE~0)} is VALID [2022-04-27 22:07:06,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-27 22:07:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:06,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204985235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:07:06,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:07:06,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2022-04-27 22:07:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768021468] [2022-04-27 22:07:06,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:07:06,649 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-04-27 22:07:06,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:07:06,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:06,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:06,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 22:07:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:07:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 22:07:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=825, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 22:07:06,702 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:07,483 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2022-04-27 22:07:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 22:07:07,483 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-04-27 22:07:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:07:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2022-04-27 22:07:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2022-04-27 22:07:07,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 96 transitions. [2022-04-27 22:07:07,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:07,560 INFO L225 Difference]: With dead ends: 63 [2022-04-27 22:07:07,560 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 22:07:07,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1268, Invalid=2392, Unknown=0, NotChecked=0, Total=3660 [2022-04-27 22:07:07,561 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:07:07,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 23 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 22:07:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 22:07:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 22:07:07,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:07:07,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:07,588 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:07,588 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:07,590 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-27 22:07:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-27 22:07:07,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:07,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:07,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-27 22:07:07,590 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-27 22:07:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:07,592 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-27 22:07:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-27 22:07:07,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:07,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:07,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:07:07,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:07:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-04-27 22:07:07,594 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 32 [2022-04-27 22:07:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:07:07,594 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-04-27 22:07:07,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:07:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-27 22:07:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 22:07:07,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:07:07,595 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:07:07,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 22:07:07,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:07:07,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:07:07,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:07:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1302475432, now seen corresponding path program 4 times [2022-04-27 22:07:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:07:07,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657272541] [2022-04-27 22:07:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:07:07,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:07:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:08,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:07:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:08,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {1385#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {1361#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:08,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1361#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1361#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:08,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1361#(<= 50000001 ~SIZE~0)} {1356#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1361#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:08,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {1356#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1385#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:07:08,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {1361#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:08,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {1361#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1361#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:08,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1361#(<= 50000001 ~SIZE~0)} {1356#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1361#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:08,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {1361#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1361#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 22:07:08,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {1361#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1362#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:08,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {1362#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1362#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 22:07:08,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {1362#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1363#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 22:07:08,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {1363#(<= (+ main_~i~0 49999993) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1363#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 22:07:08,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {1363#(<= (+ main_~i~0 49999993) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1364#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 22:07:08,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {1364#(<= (+ main_~i~0 49999985) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1364#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 22:07:08,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {1364#(<= (+ main_~i~0 49999985) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1365#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 22:07:08,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {1365#(<= (+ main_~i~0 49999977) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1365#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 22:07:08,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {1365#(<= (+ main_~i~0 49999977) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1366#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {1366#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1366#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {1366#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1367#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 22:07:08,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#(<= (+ main_~i~0 49999961) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1367#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 22:07:08,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#(<= (+ main_~i~0 49999961) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1368#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {1368#(<= (+ 49999953 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1368#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {1368#(<= (+ 49999953 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1369#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {1369#(<= (+ 49999945 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1369#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {1369#(<= (+ 49999945 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1370#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 22:07:08,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {1370#(<= (+ main_~i~0 49999937) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1370#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 22:07:08,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {1370#(<= (+ main_~i~0 49999937) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1371#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {1371#(<= (+ 49999929 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1371#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {1371#(<= (+ 49999929 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1372#(<= (+ 49999921 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {1372#(<= (+ 49999921 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1372#(<= (+ 49999921 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {1372#(<= (+ 49999921 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1373#(<= (+ 49999913 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {1373#(<= (+ 49999913 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1373#(<= (+ 49999913 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {1373#(<= (+ 49999913 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1374#(<= (+ main_~i~0 49999905) ~SIZE~0)} is VALID [2022-04-27 22:07:08,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {1374#(<= (+ main_~i~0 49999905) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1374#(<= (+ main_~i~0 49999905) ~SIZE~0)} is VALID [2022-04-27 22:07:08,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {1374#(<= (+ main_~i~0 49999905) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1375#(<= (+ main_~i~0 49999897) ~SIZE~0)} is VALID [2022-04-27 22:07:08,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {1375#(<= (+ main_~i~0 49999897) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1375#(<= (+ main_~i~0 49999897) ~SIZE~0)} is VALID [2022-04-27 22:07:08,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {1375#(<= (+ main_~i~0 49999897) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1376#(<= (+ main_~i~0 49999889) ~SIZE~0)} is VALID [2022-04-27 22:07:08,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {1376#(<= (+ main_~i~0 49999889) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1376#(<= (+ main_~i~0 49999889) ~SIZE~0)} is VALID [2022-04-27 22:07:08,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {1376#(<= (+ main_~i~0 49999889) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1377#(<= (+ main_~i~0 49999881) ~SIZE~0)} is VALID [2022-04-27 22:07:08,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {1377#(<= (+ main_~i~0 49999881) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1377#(<= (+ main_~i~0 49999881) ~SIZE~0)} is VALID [2022-04-27 22:07:08,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {1377#(<= (+ main_~i~0 49999881) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1378#(<= (+ 49999873 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {1378#(<= (+ 49999873 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1378#(<= (+ 49999873 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {1378#(<= (+ 49999873 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1379#(<= (+ main_~i~0 49999865) ~SIZE~0)} is VALID [2022-04-27 22:07:08,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {1379#(<= (+ main_~i~0 49999865) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1379#(<= (+ main_~i~0 49999865) ~SIZE~0)} is VALID [2022-04-27 22:07:08,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {1379#(<= (+ main_~i~0 49999865) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1380#(<= (+ main_~i~0 49999857) ~SIZE~0)} is VALID [2022-04-27 22:07:08,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {1380#(<= (+ main_~i~0 49999857) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1380#(<= (+ main_~i~0 49999857) ~SIZE~0)} is VALID [2022-04-27 22:07:08,170 INFO L290 TraceCheckUtils]: 43: Hoare triple {1380#(<= (+ main_~i~0 49999857) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1381#(<= (+ main_~i~0 49999849) ~SIZE~0)} is VALID [2022-04-27 22:07:08,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {1381#(<= (+ main_~i~0 49999849) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1381#(<= (+ main_~i~0 49999849) ~SIZE~0)} is VALID [2022-04-27 22:07:08,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {1381#(<= (+ main_~i~0 49999849) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1382#(<= (+ main_~i~0 49999841) ~SIZE~0)} is VALID [2022-04-27 22:07:08,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {1382#(<= (+ main_~i~0 49999841) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1382#(<= (+ main_~i~0 49999841) ~SIZE~0)} is VALID [2022-04-27 22:07:08,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {1382#(<= (+ main_~i~0 49999841) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1383#(<= (+ main_~i~0 49999833) ~SIZE~0)} is VALID [2022-04-27 22:07:08,172 INFO L290 TraceCheckUtils]: 48: Hoare triple {1383#(<= (+ main_~i~0 49999833) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1383#(<= (+ main_~i~0 49999833) ~SIZE~0)} is VALID [2022-04-27 22:07:08,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {1383#(<= (+ main_~i~0 49999833) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1384#(<= (+ 49999825 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 22:07:08,173 INFO L290 TraceCheckUtils]: 50: Hoare triple {1384#(<= (+ 49999825 main_~i~0) ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1357#false} is VALID [2022-04-27 22:07:08,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {1357#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1357#false} is VALID [2022-04-27 22:07:08,173 INFO L272 TraceCheckUtils]: 52: Hoare triple {1357#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {1357#false} is VALID [2022-04-27 22:07:08,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {1357#false} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1357#false} is VALID [2022-04-27 22:07:08,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {1357#false} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1357#false} is VALID [2022-04-27 22:07:08,173 INFO L290 TraceCheckUtils]: 55: Hoare triple {1357#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1357#false} is VALID [2022-04-27 22:07:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:07:08,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657272541] [2022-04-27 22:07:08,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657272541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:07:08,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178385465] [2022-04-27 22:07:08,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 22:07:08,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:07:08,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:07:08,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:07:08,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 22:07:08,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 22:07:08,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:07:08,240 WARN L261 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-27 22:07:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:07:08,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:07:08,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {1356#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#true} is VALID [2022-04-27 22:07:08,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {1356#true} is VALID [2022-04-27 22:07:08,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#true} is VALID [2022-04-27 22:07:08,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1356#true} {1356#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#true} is VALID [2022-04-27 22:07:08,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {1356#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#true} is VALID [2022-04-27 22:07:08,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {1356#true} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1404#(= main_~i~0 0)} is VALID [2022-04-27 22:07:08,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {1404#(= main_~i~0 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1404#(= main_~i~0 0)} is VALID [2022-04-27 22:07:08,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {1404#(= main_~i~0 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1411#(= (+ main_~i~0 (- 8)) 0)} is VALID [2022-04-27 22:07:08,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {1411#(= (+ main_~i~0 (- 8)) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1411#(= (+ main_~i~0 (- 8)) 0)} is VALID [2022-04-27 22:07:08,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {1411#(= (+ main_~i~0 (- 8)) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1418#(= (+ (- 16) main_~i~0) 0)} is VALID [2022-04-27 22:07:08,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {1418#(= (+ (- 16) main_~i~0) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1418#(= (+ (- 16) main_~i~0) 0)} is VALID [2022-04-27 22:07:08,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {1418#(= (+ (- 16) main_~i~0) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1425#(= (+ main_~i~0 (- 24)) 0)} is VALID [2022-04-27 22:07:08,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {1425#(= (+ main_~i~0 (- 24)) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1425#(= (+ main_~i~0 (- 24)) 0)} is VALID [2022-04-27 22:07:08,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {1425#(= (+ main_~i~0 (- 24)) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1432#(= (+ main_~i~0 (- 32)) 0)} is VALID [2022-04-27 22:07:08,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {1432#(= (+ main_~i~0 (- 32)) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1432#(= (+ main_~i~0 (- 32)) 0)} is VALID [2022-04-27 22:07:08,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {1432#(= (+ main_~i~0 (- 32)) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1439#(= (+ (- 40) main_~i~0) 0)} is VALID [2022-04-27 22:07:08,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {1439#(= (+ (- 40) main_~i~0) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1439#(= (+ (- 40) main_~i~0) 0)} is VALID [2022-04-27 22:07:08,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {1439#(= (+ (- 40) main_~i~0) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1446#(= main_~i~0 48)} is VALID [2022-04-27 22:07:08,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {1446#(= main_~i~0 48)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1446#(= main_~i~0 48)} is VALID [2022-04-27 22:07:08,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {1446#(= main_~i~0 48)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1453#(= (+ main_~i~0 (- 8)) 48)} is VALID [2022-04-27 22:07:08,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {1453#(= (+ main_~i~0 (- 8)) 48)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1453#(= (+ main_~i~0 (- 8)) 48)} is VALID [2022-04-27 22:07:08,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {1453#(= (+ main_~i~0 (- 8)) 48)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1460#(= (+ (- 16) main_~i~0) 48)} is VALID [2022-04-27 22:07:08,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {1460#(= (+ (- 16) main_~i~0) 48)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1460#(= (+ (- 16) main_~i~0) 48)} is VALID [2022-04-27 22:07:08,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {1460#(= (+ (- 16) main_~i~0) 48)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1467#(= (+ main_~i~0 (- 24)) 48)} is VALID [2022-04-27 22:07:08,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {1467#(= (+ main_~i~0 (- 24)) 48)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1467#(= (+ main_~i~0 (- 24)) 48)} is VALID [2022-04-27 22:07:08,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {1467#(= (+ main_~i~0 (- 24)) 48)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1474#(= main_~i~0 80)} is VALID [2022-04-27 22:07:08,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {1474#(= main_~i~0 80)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1474#(= main_~i~0 80)} is VALID [2022-04-27 22:07:08,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {1474#(= main_~i~0 80)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1481#(= (+ main_~i~0 (- 8)) 80)} is VALID [2022-04-27 22:07:08,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {1481#(= (+ main_~i~0 (- 8)) 80)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1481#(= (+ main_~i~0 (- 8)) 80)} is VALID [2022-04-27 22:07:08,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {1481#(= (+ main_~i~0 (- 8)) 80)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1488#(= (+ (- 16) main_~i~0) 80)} is VALID [2022-04-27 22:07:08,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {1488#(= (+ (- 16) main_~i~0) 80)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1488#(= (+ (- 16) main_~i~0) 80)} is VALID [2022-04-27 22:07:08,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {1488#(= (+ (- 16) main_~i~0) 80)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1495#(= 104 main_~i~0)} is VALID [2022-04-27 22:07:08,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {1495#(= 104 main_~i~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1495#(= 104 main_~i~0)} is VALID [2022-04-27 22:07:08,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {1495#(= 104 main_~i~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1502#(= 104 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 22:07:08,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {1502#(= 104 (+ main_~i~0 (- 8)))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1502#(= 104 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 22:07:08,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {1502#(= 104 (+ main_~i~0 (- 8)))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1509#(= main_~i~0 120)} is VALID [2022-04-27 22:07:08,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {1509#(= main_~i~0 120)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1509#(= main_~i~0 120)} is VALID [2022-04-27 22:07:08,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {1509#(= main_~i~0 120)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1516#(= main_~i~0 128)} is VALID [2022-04-27 22:07:08,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {1516#(= main_~i~0 128)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1516#(= main_~i~0 128)} is VALID [2022-04-27 22:07:08,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {1516#(= main_~i~0 128)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1523#(= (+ main_~i~0 (- 8)) 128)} is VALID [2022-04-27 22:07:08,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {1523#(= (+ main_~i~0 (- 8)) 128)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1523#(= (+ main_~i~0 (- 8)) 128)} is VALID [2022-04-27 22:07:08,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {1523#(= (+ main_~i~0 (- 8)) 128)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1530#(= main_~i~0 144)} is VALID [2022-04-27 22:07:08,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {1530#(= main_~i~0 144)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1530#(= main_~i~0 144)} is VALID [2022-04-27 22:07:08,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {1530#(= main_~i~0 144)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1537#(= 144 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 22:07:08,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {1537#(= 144 (+ main_~i~0 (- 8)))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1537#(= 144 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 22:07:08,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {1537#(= 144 (+ main_~i~0 (- 8)))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1544#(= (+ (- 16) main_~i~0) 144)} is VALID [2022-04-27 22:07:08,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {1544#(= (+ (- 16) main_~i~0) 144)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1544#(= (+ (- 16) main_~i~0) 144)} is VALID [2022-04-27 22:07:08,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {1544#(= (+ (- 16) main_~i~0) 144)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1551#(= main_~i~0 168)} is VALID [2022-04-27 22:07:08,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {1551#(= main_~i~0 168)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1551#(= main_~i~0 168)} is VALID [2022-04-27 22:07:08,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {1551#(= main_~i~0 168)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1558#(= (+ main_~i~0 (- 8)) 168)} is VALID [2022-04-27 22:07:08,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {1558#(= (+ main_~i~0 (- 8)) 168)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1558#(= (+ main_~i~0 (- 8)) 168)} is VALID [2022-04-27 22:07:08,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {1558#(= (+ main_~i~0 (- 8)) 168)} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1565#(and (= (+ main_~i~0 (- 8)) 168) (= main_~j~0 (div main_~i~0 4)))} is VALID [2022-04-27 22:07:08,898 INFO L272 TraceCheckUtils]: 52: Hoare triple {1565#(and (= (+ main_~i~0 (- 8)) 168) (= main_~j~0 (div main_~i~0 4)))} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {1569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:07:08,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {1569#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:07:08,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {1573#(<= 1 __VERIFIER_assert_~cond)} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1357#false} is VALID [2022-04-27 22:07:08,899 INFO L290 TraceCheckUtils]: 55: Hoare triple {1357#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1357#false} is VALID [2022-04-27 22:07:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:07:08,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:07:09,870 INFO L290 TraceCheckUtils]: 55: Hoare triple {1357#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1357#false} is VALID [2022-04-27 22:07:09,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {1573#(<= 1 __VERIFIER_assert_~cond)} [71] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1357#false} is VALID [2022-04-27 22:07:09,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {1569#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:07:09,871 INFO L272 TraceCheckUtils]: 52: Hoare triple {1589#(= main_~i~0 (* main_~j~0 4))} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {1569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:07:09,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1589#(= main_~i~0 (* main_~j~0 4))} is VALID [2022-04-27 22:07:09,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {1356#true} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1593#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 22:07:09,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {1356#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#true} is VALID [2022-04-27 22:07:09,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1356#true} {1356#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#true} is VALID [2022-04-27 22:07:09,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {1356#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#true} is VALID [2022-04-27 22:07:09,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {1356#true} is VALID [2022-04-27 22:07:09,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {1356#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#true} is VALID [2022-04-27 22:07:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-27 22:07:09,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178385465] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:07:09,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:07:09,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [26, 28] total 55 [2022-04-27 22:07:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819548616] [2022-04-27 22:07:09,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:07:09,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 22:07:09,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:07:09,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:09,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:09,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:07:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:07:09,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:07:09,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2580, Unknown=0, NotChecked=0, Total=2970 [2022-04-27 22:07:09,913 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:09,997 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-27 22:07:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:07:09,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 22:07:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:07:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 22:07:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-27 22:07:09,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-27 22:07:10,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:07:10,020 INFO L225 Difference]: With dead ends: 57 [2022-04-27 22:07:10,020 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:07:10,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 23 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=394, Invalid=2686, Unknown=0, NotChecked=0, Total=3080 [2022-04-27 22:07:10,022 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:07:10,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:07:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:07:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:07:10,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:07:10,022 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-27 22:07:10,022 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-27 22:07:10,023 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-27 22:07:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:10,023 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:07:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:07:10,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:10,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:10,023 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-27 22:07:10,023 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-27 22:07:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:07:10,023 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:07:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:07:10,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:10,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:07:10,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:07:10,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:07:10,024 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-27 22:07:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:07:10,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2022-04-27 22:07:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:07:10,024 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:07:10,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:07:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:07:10,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:07:10,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:07:10,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 22:07:10,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:07:10,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:07:10,324 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 22:07:10,324 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:07:10,324 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:07:10,324 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:07:10,324 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 34) the Hoare annotation is: true [2022-04-27 22:07:10,325 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 23 30) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* (div main_~i~0 4) 4))) [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point L23-2(lines 23 30) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 28) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* main_~j~0 4))) [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 34) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 34) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 17) the Hoare annotation is: true [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 15) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 17) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 22:07:10,325 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 17) no Hoare annotation was computed. [2022-04-27 22:07:10,327 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-04-27 22:07:10,329 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:07:10,331 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-27 22:07:10,332 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:07:10,333 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:07:10,333 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:07:10,333 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:07:10,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:07:10 BasicIcfg [2022-04-27 22:07:10,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:07:10,341 INFO L158 Benchmark]: Toolchain (without parser) took 8050.27ms. Allocated memory was 255.9MB in the beginning and 500.2MB in the end (delta: 244.3MB). Free memory was 197.5MB in the beginning and 391.9MB in the end (delta: -194.5MB). Peak memory consumption was 50.1MB. Max. memory is 8.0GB. [2022-04-27 22:07:10,341 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:07:10,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.02ms. Allocated memory was 255.9MB in the beginning and 401.6MB in the end (delta: 145.8MB). Free memory was 197.3MB in the beginning and 372.2MB in the end (delta: -174.8MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. [2022-04-27 22:07:10,341 INFO L158 Benchmark]: Boogie Preprocessor took 24.86ms. Allocated memory is still 401.6MB. Free memory was 372.2MB in the beginning and 370.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:07:10,341 INFO L158 Benchmark]: RCFGBuilder took 219.67ms. Allocated memory is still 401.6MB. Free memory was 370.6MB in the beginning and 360.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 22:07:10,341 INFO L158 Benchmark]: IcfgTransformer took 33.85ms. Allocated memory is still 401.6MB. Free memory was 360.1MB in the beginning and 358.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:07:10,342 INFO L158 Benchmark]: TraceAbstraction took 7562.34ms. Allocated memory was 401.6MB in the beginning and 500.2MB in the end (delta: 98.6MB). Free memory was 358.4MB in the beginning and 391.9MB in the end (delta: -33.5MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB. [2022-04-27 22:07:10,343 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 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.02ms. Allocated memory was 255.9MB in the beginning and 401.6MB in the end (delta: 145.8MB). Free memory was 197.3MB in the beginning and 372.2MB in the end (delta: -174.8MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.86ms. Allocated memory is still 401.6MB. Free memory was 372.2MB in the beginning and 370.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 219.67ms. Allocated memory is still 401.6MB. Free memory was 370.6MB in the beginning and 360.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 33.85ms. Allocated memory is still 401.6MB. Free memory was 360.1MB in the beginning and 358.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7562.34ms. Allocated memory was 401.6MB in the beginning and 500.2MB in the end (delta: 98.6MB). Free memory was 358.4MB in the beginning and 391.9MB in the end (delta: -33.5MB). Peak memory consumption was 65.6MB. 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: 14]: 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 70 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 164 SyntacticMatches, 23 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2531 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=5, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 35 NumberOfFragments, 38 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 380 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 268 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 1626 SizeOfPredicates, 7 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 484/1803 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: 23]: Loop Invariant Derived loop invariant: !(50000001 <= SIZE) || i == i / 4 * 4 RESULT: Ultimate proved your program to be correct! [2022-04-27 22:07:10,359 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...