/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/nla-digbench-scaling/ps5-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 04:30:34,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 04:30:34,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 04:30:34,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 04:30:34,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 04:30:34,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 04:30:34,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 04:30:34,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 04:30:34,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 04:30:34,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 04:30:34,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 04:30:34,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 04:30:34,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 04:30:34,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 04:30:34,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 04:30:34,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 04:30:34,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 04:30:34,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 04:30:34,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 04:30:34,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 04:30:34,961 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 04:30:34,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 04:30:34,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 04:30:34,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 04:30:34,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 04:30:34,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 04:30:34,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 04:30:34,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 04:30:34,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 04:30:34,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 04:30:34,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 04:30:34,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 04:30:34,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 04:30:34,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 04:30:34,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 04:30:34,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 04:30:34,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 04:30:34,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 04:30:34,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 04:30:34,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 04:30:34,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 04:30:34,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 04:30:34,978 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 04:30:34,996 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 04:30:34,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 04:30:34,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 04:30:34,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 04:30:34,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 04:30:34,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 04:30:34,998 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 04:30:34,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 04:30:34,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 04:30:34,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 04:30:34,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 04:30:34,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 04:30:34,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 04:30:34,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 04:30:34,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 04:30:34,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 04:30:34,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 04:30:34,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 04:30:34,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 04:30:34,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 04:30:34,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 04:30:34,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 04:30:34,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 04:30:35,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 04:30:35,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 04:30:35,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 04:30:35,000 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 04:30:35,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 04:30:35,000 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 04:30:35,000 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 04:30:35,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 04:30:35,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 04:30:35,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 04:30:35,242 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 04:30:35,243 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 04:30:35,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound10.c [2022-04-15 04:30:35,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb004ed8f/f4fa6f96521d4180b3c3de5e287336f0/FLAG388d6d1ce [2022-04-15 04:30:35,653 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 04:30:35,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound10.c [2022-04-15 04:30:35,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb004ed8f/f4fa6f96521d4180b3c3de5e287336f0/FLAG388d6d1ce [2022-04-15 04:30:35,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb004ed8f/f4fa6f96521d4180b3c3de5e287336f0 [2022-04-15 04:30:35,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 04:30:35,673 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 04:30:35,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 04:30:35,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 04:30:35,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 04:30:35,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226ea69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35, skipping insertion in model container [2022-04-15 04:30:35,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 04:30:35,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 04:30:35,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound10.c[458,471] [2022-04-15 04:30:35,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 04:30:35,868 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 04:30:35,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound10.c[458,471] [2022-04-15 04:30:35,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 04:30:35,907 INFO L208 MainTranslator]: Completed translation [2022-04-15 04:30:35,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35 WrapperNode [2022-04-15 04:30:35,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 04:30:35,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 04:30:35,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 04:30:35,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 04:30:35,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 04:30:35,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 04:30:35,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 04:30:35,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 04:30:35,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35" (1/1) ... [2022-04-15 04:30:35,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 04:30:35,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:30:35,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 04:30:35,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 04:30:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 04:30:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 04:30:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 04:30:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 04:30:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 04:30:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 04:30:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 04:30:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 04:30:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 04:30:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 04:30:36,061 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 04:30:36,063 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 04:30:36,207 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 04:30:36,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 04:30:36,212 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 04:30:36,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:30:36 BoogieIcfgContainer [2022-04-15 04:30:36,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 04:30:36,214 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 04:30:36,214 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 04:30:36,214 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 04:30:36,229 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:30:36" (1/1) ... [2022-04-15 04:30:36,230 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 04:30:36,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 04:30:36 BasicIcfg [2022-04-15 04:30:36,258 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 04:30:36,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 04:30:36,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 04:30:36,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 04:30:36,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 04:30:35" (1/4) ... [2022-04-15 04:30:36,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd3992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:30:36, skipping insertion in model container [2022-04-15 04:30:36,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:30:35" (2/4) ... [2022-04-15 04:30:36,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd3992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:30:36, skipping insertion in model container [2022-04-15 04:30:36,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:30:36" (3/4) ... [2022-04-15 04:30:36,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd3992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 04:30:36, skipping insertion in model container [2022-04-15 04:30:36,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 04:30:36" (4/4) ... [2022-04-15 04:30:36,262 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound10.cqvasr [2022-04-15 04:30:36,265 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 04:30:36,265 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 04:30:36,317 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 04:30:36,321 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 04:30:36,321 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 04:30:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 04:30:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 04:30:36,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:30:36,366 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:30:36,366 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:30:36,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:30:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash 843387237, now seen corresponding path program 1 times [2022-04-15 04:30:36,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:30:36,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883373776] [2022-04-15 04:30:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:30:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:36,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 04:30:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:36,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {32#true} is VALID [2022-04-15 04:30:36,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-15 04:30:36,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-15 04:30:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 04:30:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:36,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-15 04:30:36,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [75] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-15 04:30:36,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-15 04:30:36,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-15 04:30:36,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 04:30:36,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {32#true} is VALID [2022-04-15 04:30:36,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-15 04:30:36,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-15 04:30:36,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-15 04:30:36,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {32#true} is VALID [2022-04-15 04:30:36,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-15 04:30:36,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-15 04:30:36,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [75] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-15 04:30:36,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-15 04:30:36,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-15 04:30:36,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {33#false} is VALID [2022-04-15 04:30:36,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} [73] L28-3-->L28-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-15 04:30:36,539 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {33#false} is VALID [2022-04-15 04:30:36,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID [2022-04-15 04:30:36,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-15 04:30:36,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-15 04:30:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 04:30:36,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:30:36,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883373776] [2022-04-15 04:30:36,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883373776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:30:36,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:30:36,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 04:30:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047236239] [2022-04-15 04:30:36,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:30:36,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 04:30:36,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:30:36,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:36,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:36,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 04:30:36,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:30:36,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 04:30:36,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 04:30:36,601 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:36,736 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-15 04:30:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 04:30:36,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 04:30:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:30:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-15 04:30:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-15 04:30:36,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-15 04:30:36,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:36,826 INFO L225 Difference]: With dead ends: 50 [2022-04-15 04:30:36,826 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 04:30:36,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-15 04:30:36,831 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:30:36,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:30:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 04:30:36,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 04:30:36,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:30:36,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:30:36,850 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:30:36,850 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:30:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:36,853 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 04:30:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 04:30:36,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:36,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:36,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-15 04:30:36,854 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-15 04:30:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:36,856 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 04:30:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 04:30:36,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:36,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:36,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:30:36,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:30:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:30:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-15 04:30:36,859 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-15 04:30:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:30:36,860 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-15 04:30:36,860 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 04:30:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 04:30:36,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:30:36,860 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:30:36,861 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 04:30:36,861 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:30:36,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:30:36,861 INFO L85 PathProgramCache]: Analyzing trace with hash 208087835, now seen corresponding path program 1 times [2022-04-15 04:30:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:30:36,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953516447] [2022-04-15 04:30:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:30:36,876 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:30:36,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588758662] [2022-04-15 04:30:36,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:36,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:36,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:30:36,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:30:36,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 04:30:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:36,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 04:30:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:36,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:30:37,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 04:30:37,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(<= ~counter~0 0)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#(<= ~counter~0 0)} {196#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#(<= ~counter~0 0)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#(<= ~counter~0 0)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {204#(<= ~counter~0 0)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#(<= ~counter~0 0)} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= ~counter~0 0)} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(<= ~counter~0 0)} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204#(<= ~counter~0 0)} {204#(<= ~counter~0 0)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#(<= ~counter~0 0)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {204#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:37,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#(<= ~counter~0 0)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {238#(<= |main_#t~post5| 0)} is VALID [2022-04-15 04:30:37,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(<= |main_#t~post5| 0)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 10)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {197#false} is VALID [2022-04-15 04:30:37,100 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {197#false} is VALID [2022-04-15 04:30:37,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {197#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {197#false} is VALID [2022-04-15 04:30:37,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {197#false} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 04:30:37,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {197#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 04:30:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 04:30:37,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 04:30:37,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:30:37,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953516447] [2022-04-15 04:30:37,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:30:37,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588758662] [2022-04-15 04:30:37,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588758662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:30:37,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:30:37,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 04:30:37,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284774875] [2022-04-15 04:30:37,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:30:37,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 04:30:37,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:30:37,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 04:30:37,133 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-15 04:30:37,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 04:30:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:30:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 04:30:37,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 04:30:37,135 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 04:30:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:37,193 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 04:30:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 04:30:37,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 04:30:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:30:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 04:30:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 04:30:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 04:30:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 04:30:37,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 04:30:37,232 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-15 04:30:37,233 INFO L225 Difference]: With dead ends: 34 [2022-04-15 04:30:37,234 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 04:30:37,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 04:30:37,236 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:30:37,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:30:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 04:30:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 04:30:37,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:30:37,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:30:37,243 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:30:37,243 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:30:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:37,244 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 04:30:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 04:30:37,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:37,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:37,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 04:30:37,246 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 04:30:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:37,247 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 04:30:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 04:30:37,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:37,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:37,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:30:37,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:30:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 04:30:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 04:30:37,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-15 04:30:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:30:37,257 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 04:30:37,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 04:30:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 04:30:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 04:30:37,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:30:37,259 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:30:37,280 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-15 04:30:37,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:37,468 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:30:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:30:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 209190102, now seen corresponding path program 1 times [2022-04-15 04:30:37,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:30:37,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376685963] [2022-04-15 04:30:37,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:37,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:30:37,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:30:37,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207325806] [2022-04-15 04:30:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:37,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:37,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:30:37,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:30:37,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 04:30:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:37,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 04:30:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:37,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:30:37,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {392#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {392#true} is VALID [2022-04-15 04:30:37,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {392#true} is VALID [2022-04-15 04:30:37,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {392#true} is VALID [2022-04-15 04:30:37,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {392#true} {392#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {392#true} is VALID [2022-04-15 04:30:37,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {392#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {392#true} is VALID [2022-04-15 04:30:37,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {392#true} is VALID [2022-04-15 04:30:37,655 INFO L272 TraceCheckUtils]: 6: Hoare triple {392#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {392#true} is VALID [2022-04-15 04:30:37,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {392#true} is VALID [2022-04-15 04:30:37,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {392#true} is VALID [2022-04-15 04:30:37,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {392#true} is VALID [2022-04-15 04:30:37,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {392#true} {392#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {392#true} is VALID [2022-04-15 04:30:37,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {392#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:37,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:37,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:37,663 INFO L272 TraceCheckUtils]: 14: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:30:37,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:30:37,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {444#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {393#false} is VALID [2022-04-15 04:30:37,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#false} is VALID [2022-04-15 04:30:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 04:30:37,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 04:30:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:30:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376685963] [2022-04-15 04:30:37,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:30:37,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207325806] [2022-04-15 04:30:37,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207325806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 04:30:37,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 04:30:37,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 04:30:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655461763] [2022-04-15 04:30:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:30:37,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 04:30:37,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:30:37,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:37,682 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-15 04:30:37,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 04:30:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:30:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 04:30:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 04:30:37,683 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:37,804 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 04:30:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 04:30:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 04:30:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:30:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 04:30:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 04:30:37,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 04:30:37,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:37,841 INFO L225 Difference]: With dead ends: 36 [2022-04-15 04:30:37,841 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 04:30:37,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 04:30:37,843 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:30:37,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:30:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 04:30:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 04:30:37,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:30:37,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:30:37,853 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:30:37,853 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:30:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:37,855 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 04:30:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 04:30:37,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:37,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:37,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-15 04:30:37,860 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-15 04:30:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:37,861 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 04:30:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 04:30:37,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:37,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:37,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:30:37,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:30:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 04:30:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-15 04:30:37,863 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-15 04:30:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:30:37,863 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-15 04:30:37,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 04:30:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 04:30:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 04:30:37,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:30:37,864 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:30:37,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 04:30:38,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 04:30:38,080 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:30:38,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:30:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1223799235, now seen corresponding path program 1 times [2022-04-15 04:30:38,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:30:38,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772238342] [2022-04-15 04:30:38,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:38,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:30:38,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:30:38,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544556479] [2022-04-15 04:30:38,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:38,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:38,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:30:38,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:30:38,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 04:30:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:38,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 04:30:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:38,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:30:38,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {614#true} is VALID [2022-04-15 04:30:38,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(<= ~counter~0 0)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#(<= ~counter~0 0)} {614#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#(<= ~counter~0 0)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#(<= ~counter~0 0)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {622#(<= ~counter~0 0)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(<= ~counter~0 0)} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {622#(<= ~counter~0 0)} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(<= ~counter~0 0)} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {622#(<= ~counter~0 0)} {622#(<= ~counter~0 0)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {622#(<= ~counter~0 0)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {622#(<= ~counter~0 0)} is VALID [2022-04-15 04:30:38,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {622#(<= ~counter~0 0)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {656#(<= ~counter~0 1)} is VALID [2022-04-15 04:30:38,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#(<= ~counter~0 1)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {656#(<= ~counter~0 1)} is VALID [2022-04-15 04:30:38,266 INFO L272 TraceCheckUtils]: 14: Hoare triple {656#(<= ~counter~0 1)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {656#(<= ~counter~0 1)} is VALID [2022-04-15 04:30:38,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#(<= ~counter~0 1)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {656#(<= ~counter~0 1)} is VALID [2022-04-15 04:30:38,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= ~counter~0 1)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {656#(<= ~counter~0 1)} is VALID [2022-04-15 04:30:38,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#(<= ~counter~0 1)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#(<= ~counter~0 1)} is VALID [2022-04-15 04:30:38,272 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#(<= ~counter~0 1)} {656#(<= ~counter~0 1)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {656#(<= ~counter~0 1)} is VALID [2022-04-15 04:30:38,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= ~counter~0 1)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {656#(<= ~counter~0 1)} is VALID [2022-04-15 04:30:38,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#(<= ~counter~0 1)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {681#(<= |main_#t~post5| 1)} is VALID [2022-04-15 04:30:38,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#(<= |main_#t~post5| 1)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 10)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {615#false} is VALID [2022-04-15 04:30:38,273 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {615#false} is VALID [2022-04-15 04:30:38,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {615#false} is VALID [2022-04-15 04:30:38,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {615#false} is VALID [2022-04-15 04:30:38,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {615#false} is VALID [2022-04-15 04:30:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 04:30:38,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:30:38,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {615#false} is VALID [2022-04-15 04:30:38,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {615#false} is VALID [2022-04-15 04:30:38,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {615#false} is VALID [2022-04-15 04:30:38,416 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {615#false} is VALID [2022-04-15 04:30:38,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#(< |main_#t~post5| 10)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 10)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {615#false} is VALID [2022-04-15 04:30:38,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {713#(< ~counter~0 10)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {709#(< |main_#t~post5| 10)} is VALID [2022-04-15 04:30:38,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(< ~counter~0 10)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {713#(< ~counter~0 10)} is VALID [2022-04-15 04:30:38,418 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {614#true} {713#(< ~counter~0 10)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {713#(< ~counter~0 10)} is VALID [2022-04-15 04:30:38,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {614#true} is VALID [2022-04-15 04:30:38,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {614#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {614#true} is VALID [2022-04-15 04:30:38,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {614#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {614#true} is VALID [2022-04-15 04:30:38,419 INFO L272 TraceCheckUtils]: 14: Hoare triple {713#(< ~counter~0 10)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {614#true} is VALID [2022-04-15 04:30:38,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(< ~counter~0 10)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {713#(< ~counter~0 10)} is VALID [2022-04-15 04:30:38,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {738#(< ~counter~0 9)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {713#(< ~counter~0 10)} is VALID [2022-04-15 04:30:38,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {738#(< ~counter~0 9)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {738#(< ~counter~0 9)} is VALID [2022-04-15 04:30:38,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {614#true} {738#(< ~counter~0 9)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {738#(< ~counter~0 9)} is VALID [2022-04-15 04:30:38,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {614#true} is VALID [2022-04-15 04:30:38,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {614#true} is VALID [2022-04-15 04:30:38,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {614#true} is VALID [2022-04-15 04:30:38,421 INFO L272 TraceCheckUtils]: 6: Hoare triple {738#(< ~counter~0 9)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {614#true} is VALID [2022-04-15 04:30:38,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#(< ~counter~0 9)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {738#(< ~counter~0 9)} is VALID [2022-04-15 04:30:38,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#(< ~counter~0 9)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#(< ~counter~0 9)} is VALID [2022-04-15 04:30:38,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#(< ~counter~0 9)} {614#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#(< ~counter~0 9)} is VALID [2022-04-15 04:30:38,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#(< ~counter~0 9)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#(< ~counter~0 9)} is VALID [2022-04-15 04:30:38,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {738#(< ~counter~0 9)} is VALID [2022-04-15 04:30:38,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {614#true} is VALID [2022-04-15 04:30:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 04:30:38,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:30:38,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772238342] [2022-04-15 04:30:38,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:30:38,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544556479] [2022-04-15 04:30:38,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544556479] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 04:30:38,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 04:30:38,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 04:30:38,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309809208] [2022-04-15 04:30:38,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 04:30:38,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-15 04:30:38,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:30:38,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:38,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:38,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 04:30:38,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:30:38,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 04:30:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 04:30:38,461 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:38,631 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-15 04:30:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 04:30:38,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-15 04:30:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:30:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-15 04:30:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-15 04:30:38,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-15 04:30:38,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:38,699 INFO L225 Difference]: With dead ends: 66 [2022-04-15 04:30:38,699 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 04:30:38,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 04:30:38,700 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:30:38,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:30:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 04:30:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-04-15 04:30:38,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:30:38,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:30:38,713 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:30:38,713 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:30:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:38,715 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-15 04:30:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-15 04:30:38,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:38,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:38,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-15 04:30:38,716 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-15 04:30:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:38,718 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-15 04:30:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-15 04:30:38,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:38,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:38,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:30:38,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:30:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:30:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-15 04:30:38,720 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 26 [2022-04-15 04:30:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:30:38,720 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-15 04:30:38,721 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 04:30:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 04:30:38,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:30:38,721 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:30:38,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 04:30:38,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:38,939 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:30:38,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:30:38,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1222696968, now seen corresponding path program 1 times [2022-04-15 04:30:38,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:30:38,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535502154] [2022-04-15 04:30:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:30:38,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:30:38,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869266187] [2022-04-15 04:30:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:38,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:38,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:30:38,960 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-15 04:30:38,962 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-15 04:30:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:39,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 04:30:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:39,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:30:39,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:39,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {1072#true} is VALID [2022-04-15 04:30:39,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:39,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:39,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:39,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1072#true} is VALID [2022-04-15 04:30:39,182 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1072#true} is VALID [2022-04-15 04:30:39,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1072#true} is VALID [2022-04-15 04:30:39,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:39,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:39,183 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1072#true} is VALID [2022-04-15 04:30:39,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:39,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:39,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:39,193 INFO L272 TraceCheckUtils]: 14: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1072#true} is VALID [2022-04-15 04:30:39,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1072#true} is VALID [2022-04-15 04:30:39,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:39,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:39,194 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1110#(and (= main_~x~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:39,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-15 04:30:39,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-15 04:30:39,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-15 04:30:39,196 INFO L272 TraceCheckUtils]: 22: Hoare triple {1135#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:30:39,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:30:39,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1073#false} is VALID [2022-04-15 04:30:39,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#false} is VALID [2022-04-15 04:30:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 04:30:39,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:30:39,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#false} is VALID [2022-04-15 04:30:39,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1073#false} is VALID [2022-04-15 04:30:39,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:30:39,376 INFO L272 TraceCheckUtils]: 22: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:30:39,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 04:30:39,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 04:30:41,390 WARN L290 TraceCheckUtils]: 19: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-15 04:30:41,391 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 04:30:41,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:41,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:41,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1072#true} is VALID [2022-04-15 04:30:41,391 INFO L272 TraceCheckUtils]: 14: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1072#true} is VALID [2022-04-15 04:30:41,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 04:30:41,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 04:30:41,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1165#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 04:30:41,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1072#true} is VALID [2022-04-15 04:30:41,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:41,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:41,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1072#true} is VALID [2022-04-15 04:30:41,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1072#true} is VALID [2022-04-15 04:30:41,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1072#true} is VALID [2022-04-15 04:30:41,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:41,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:41,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:41,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {1072#true} is VALID [2022-04-15 04:30:41,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1072#true} is VALID [2022-04-15 04:30:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 04:30:41,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:30:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535502154] [2022-04-15 04:30:41,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:30:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869266187] [2022-04-15 04:30:41,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869266187] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 04:30:41,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:30:41,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 04:30:41,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874420757] [2022-04-15 04:30:41,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 04:30:41,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 04:30:41,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:30:41,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:30:41,750 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-15 04:30:41,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 04:30:41,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:30:41,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 04:30:41,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 04:30:41,751 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:30:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:41,883 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-15 04:30:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 04:30:41,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 04:30:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:30:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:30:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 04:30:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:30:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 04:30:41,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 04:30:43,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:43,171 INFO L225 Difference]: With dead ends: 68 [2022-04-15 04:30:43,171 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 04:30:43,171 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 04:30:43,171 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 04:30:43,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 04:30:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 04:30:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-15 04:30:43,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:30:43,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:30:43,191 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:30:43,191 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:30:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:43,193 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-15 04:30:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-15 04:30:43,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:43,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:43,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-15 04:30:43,193 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-15 04:30:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:43,195 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-15 04:30:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-15 04:30:43,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:43,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:43,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:30:43,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:30:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 04:30:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-15 04:30:43,197 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 26 [2022-04-15 04:30:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:30:43,197 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-15 04:30:43,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 04:30:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-15 04:30:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 04:30:43,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:30:43,198 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:30:43,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 04:30:43,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:43,401 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:30:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:30:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash 96926796, now seen corresponding path program 1 times [2022-04-15 04:30:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:30:43,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817781692] [2022-04-15 04:30:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:30:43,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:30:43,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29085753] [2022-04-15 04:30:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:43,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:43,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:30:43,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:30:43,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 04:30:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:43,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 04:30:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:43,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:30:43,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {1530#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {1530#true} is VALID [2022-04-15 04:30:43,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {1530#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1530#true} is VALID [2022-04-15 04:30:43,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {1530#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1530#true} is VALID [2022-04-15 04:30:43,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {1530#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1530#true} is VALID [2022-04-15 04:30:43,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {1530#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {1530#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1530#true} {1530#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1530#true} is VALID [2022-04-15 04:30:43,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1530#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:43,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:43,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:43,778 INFO L272 TraceCheckUtils]: 14: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1530#true} is VALID [2022-04-15 04:30:43,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {1530#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1530#true} is VALID [2022-04-15 04:30:43,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {1530#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {1530#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,781 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1530#true} {1568#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:43,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 04:30:43,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 04:30:43,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 04:30:43,785 INFO L272 TraceCheckUtils]: 22: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1530#true} is VALID [2022-04-15 04:30:43,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1530#true} is VALID [2022-04-15 04:30:43,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {1530#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {1530#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,786 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1530#true} {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 04:30:43,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 04:30:43,786 INFO L272 TraceCheckUtils]: 28: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1530#true} is VALID [2022-04-15 04:30:43,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {1530#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1530#true} is VALID [2022-04-15 04:30:43,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {1530#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {1530#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#true} is VALID [2022-04-15 04:30:43,787 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1530#true} {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 04:30:43,788 INFO L272 TraceCheckUtils]: 33: Hoare triple {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:30:43,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:30:43,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {1641#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1531#false} is VALID [2022-04-15 04:30:43,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {1531#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1531#false} is VALID [2022-04-15 04:30:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 04:30:43,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:30:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:30:44,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817781692] [2022-04-15 04:30:44,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:30:44,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29085753] [2022-04-15 04:30:44,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29085753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 04:30:44,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:30:44,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 04:30:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413007056] [2022-04-15 04:30:44,064 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 04:30:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-15 04:30:44,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:30:44,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 04:30:44,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:44,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 04:30:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:30:44,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 04:30:44,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 04:30:44,086 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 04:30:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:44,310 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-15 04:30:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 04:30:44,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-15 04:30:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:30:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 04:30:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-15 04:30:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 04:30:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-15 04:30:44,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-15 04:30:44,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:44,351 INFO L225 Difference]: With dead ends: 59 [2022-04-15 04:30:44,351 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 04:30:44,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 04:30:44,352 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:30:44,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:30:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 04:30:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 04:30:44,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:30:44,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:30:44,373 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:30:44,373 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:30:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:44,374 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 04:30:44,374 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 04:30:44,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:44,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:44,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 04:30:44,375 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 04:30:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:44,376 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 04:30:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 04:30:44,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:44,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:44,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:30:44,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:30:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:30:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-15 04:30:44,378 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 37 [2022-04-15 04:30:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:30:44,379 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-15 04:30:44,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 04:30:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 04:30:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 04:30:44,380 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:30:44,380 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:30:44,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 04:30:44,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:44,601 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:30:44,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:30:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash -678596118, now seen corresponding path program 2 times [2022-04-15 04:30:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:30:44,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134403839] [2022-04-15 04:30:44,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:30:44,612 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:30:44,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796398546] [2022-04-15 04:30:44,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 04:30:44,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:44,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:30:44,614 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:30:44,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 04:30:44,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 04:30:44,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 04:30:44,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 04:30:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:44,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:30:44,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:44,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {1978#true} is VALID [2022-04-15 04:30:44,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:44,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:44,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:44,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1978#true} is VALID [2022-04-15 04:30:44,998 INFO L272 TraceCheckUtils]: 6: Hoare triple {1978#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1978#true} is VALID [2022-04-15 04:30:44,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1978#true} is VALID [2022-04-15 04:30:44,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:44,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:44,998 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {1978#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1978#true} is VALID [2022-04-15 04:30:44,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {1978#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:44,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:44,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:44,999 INFO L272 TraceCheckUtils]: 14: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1978#true} is VALID [2022-04-15 04:30:45,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {1978#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1978#true} is VALID [2022-04-15 04:30:45,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:45,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:45,000 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1978#true} {2016#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:45,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 04:30:45,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 04:30:45,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 04:30:45,002 INFO L272 TraceCheckUtils]: 22: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1978#true} is VALID [2022-04-15 04:30:45,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1978#true} is VALID [2022-04-15 04:30:45,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:45,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:45,003 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1978#true} {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 04:30:45,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-15 04:30:45,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-15 04:30:45,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-15 04:30:45,006 INFO L272 TraceCheckUtils]: 30: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1978#true} is VALID [2022-04-15 04:30:45,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {1978#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1978#true} is VALID [2022-04-15 04:30:45,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {1978#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:45,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {1978#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:45,006 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1978#true} {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-15 04:30:45,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-15 04:30:45,007 INFO L272 TraceCheckUtils]: 36: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1978#true} is VALID [2022-04-15 04:30:45,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {1978#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1978#true} is VALID [2022-04-15 04:30:45,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {1978#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:45,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {1978#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 04:30:45,008 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1978#true} {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-15 04:30:45,008 INFO L272 TraceCheckUtils]: 41: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:30:45,015 INFO L290 TraceCheckUtils]: 42: Hoare triple {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2114#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:30:45,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {2114#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1979#false} is VALID [2022-04-15 04:30:45,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {1979#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1979#false} is VALID [2022-04-15 04:30:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 04:30:45,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:30:45,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:30:45,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134403839] [2022-04-15 04:30:45,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:30:45,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796398546] [2022-04-15 04:30:45,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796398546] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 04:30:45,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:30:45,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-15 04:30:45,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781203977] [2022-04-15 04:30:45,276 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 04:30:45,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-15 04:30:45,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:30:45,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:45,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:45,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 04:30:45,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:30:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 04:30:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 04:30:45,301 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:45,558 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-15 04:30:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 04:30:45,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-15 04:30:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:30:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 04:30:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 04:30:45,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-15 04:30:45,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:45,595 INFO L225 Difference]: With dead ends: 58 [2022-04-15 04:30:45,595 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 04:30:45,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 04:30:45,596 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:30:45,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:30:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 04:30:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 04:30:45,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:30:45,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:30:45,615 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:30:45,615 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:30:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:45,617 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-15 04:30:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 04:30:45,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:45,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:45,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-15 04:30:45,617 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-15 04:30:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:45,618 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-15 04:30:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 04:30:45,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:45,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:45,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:30:45,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:30:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 04:30:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-15 04:30:45,620 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2022-04-15 04:30:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:30:45,620 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-15 04:30:45,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 04:30:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 04:30:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 04:30:45,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:30:45,621 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:30:45,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 04:30:45,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:45,829 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:30:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:30:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1280010632, now seen corresponding path program 3 times [2022-04-15 04:30:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:30:45,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394154460] [2022-04-15 04:30:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:30:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:30:45,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:30:45,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703671350] [2022-04-15 04:30:45,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 04:30:45,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:30:45,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:30:45,843 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:30:45,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 04:30:58,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-15 04:30:58,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 04:30:58,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 04:30:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:30:58,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:30:59,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {2445#true} is VALID [2022-04-15 04:30:59,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2445#true} is VALID [2022-04-15 04:30:59,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {2445#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2445#true} is VALID [2022-04-15 04:30:59,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2445#true} is VALID [2022-04-15 04:30:59,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2445#true} {2445#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2445#true} is VALID [2022-04-15 04:30:59,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:59,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:59,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:59,064 INFO L272 TraceCheckUtils]: 14: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2445#true} is VALID [2022-04-15 04:30:59,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {2445#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2445#true} is VALID [2022-04-15 04:30:59,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {2445#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,065 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2445#true} {2483#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:30:59,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 04:30:59,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 04:30:59,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 04:30:59,066 INFO L272 TraceCheckUtils]: 22: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2445#true} is VALID [2022-04-15 04:30:59,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {2445#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2445#true} is VALID [2022-04-15 04:30:59,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {2445#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {2445#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,067 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2445#true} {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 04:30:59,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 04:30:59,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 04:30:59,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 04:30:59,068 INFO L272 TraceCheckUtils]: 30: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2445#true} is VALID [2022-04-15 04:30:59,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {2445#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2445#true} is VALID [2022-04-15 04:30:59,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {2445#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {2445#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,069 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2445#true} {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 04:30:59,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 04:30:59,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 04:30:59,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 04:30:59,070 INFO L272 TraceCheckUtils]: 38: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2445#true} is VALID [2022-04-15 04:30:59,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {2445#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2445#true} is VALID [2022-04-15 04:30:59,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {2445#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {2445#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,071 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2445#true} {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 04:30:59,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 04:30:59,071 INFO L272 TraceCheckUtils]: 44: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2445#true} is VALID [2022-04-15 04:30:59,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {2445#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2445#true} is VALID [2022-04-15 04:30:59,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {2445#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {2445#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#true} is VALID [2022-04-15 04:30:59,072 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2445#true} {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 04:30:59,072 INFO L272 TraceCheckUtils]: 49: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:30:59,073 INFO L290 TraceCheckUtils]: 50: Hoare triple {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:30:59,074 INFO L290 TraceCheckUtils]: 51: Hoare triple {2606#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2446#false} is VALID [2022-04-15 04:30:59,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {2446#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2446#false} is VALID [2022-04-15 04:30:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 04:30:59,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:30:59,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:30:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394154460] [2022-04-15 04:30:59,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:30:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703671350] [2022-04-15 04:30:59,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703671350] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 04:30:59,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:30:59,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 04:30:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110161382] [2022-04-15 04:30:59,370 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 04:30:59,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-15 04:30:59,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:30:59,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 04:30:59,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:30:59,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 04:30:59,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:30:59,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 04:30:59,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 04:30:59,398 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 04:30:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:59,739 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 04:30:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 04:30:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-15 04:30:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:30:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 04:30:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-15 04:30:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 04:30:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-15 04:30:59,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-15 04:30:59,779 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-15 04:30:59,780 INFO L225 Difference]: With dead ends: 60 [2022-04-15 04:30:59,780 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 04:30:59,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-15 04:30:59,781 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:30:59,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:30:59,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 04:30:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 04:30:59,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:30:59,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:30:59,813 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:30:59,820 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:30:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:59,822 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-15 04:30:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 04:30:59,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:59,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:59,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 04:30:59,823 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 04:30:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:30:59,824 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-15 04:30:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 04:30:59,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:30:59,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:30:59,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:30:59,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:30:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 04:30:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-15 04:30:59,826 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-15 04:30:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:30:59,826 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-15 04:30:59,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 04:30:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 04:30:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 04:30:59,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:30:59,827 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:30:59,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 04:31:00,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:31:00,032 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:31:00,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:31:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1735624483, now seen corresponding path program 1 times [2022-04-15 04:31:00,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:31:00,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703576171] [2022-04-15 04:31:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:31:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:31:00,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:31:00,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831875881] [2022-04-15 04:31:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:31:00,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:31:00,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:31:00,044 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:31:00,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 04:31:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:31:00,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 04:31:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:31:00,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:31:00,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#(<= ~counter~0 0)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2955#(<= ~counter~0 0)} {2947#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {2955#(<= ~counter~0 0)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#(<= ~counter~0 0)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {2955#(<= ~counter~0 0)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {2955#(<= ~counter~0 0)} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {2955#(<= ~counter~0 0)} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {2955#(<= ~counter~0 0)} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,324 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2955#(<= ~counter~0 0)} {2955#(<= ~counter~0 0)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(<= ~counter~0 0)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2955#(<= ~counter~0 0)} is VALID [2022-04-15 04:31:00,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {2955#(<= ~counter~0 0)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2989#(<= ~counter~0 1)} is VALID [2022-04-15 04:31:00,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {2989#(<= ~counter~0 1)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2989#(<= ~counter~0 1)} is VALID [2022-04-15 04:31:00,326 INFO L272 TraceCheckUtils]: 14: Hoare triple {2989#(<= ~counter~0 1)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2989#(<= ~counter~0 1)} is VALID [2022-04-15 04:31:00,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {2989#(<= ~counter~0 1)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2989#(<= ~counter~0 1)} is VALID [2022-04-15 04:31:00,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {2989#(<= ~counter~0 1)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2989#(<= ~counter~0 1)} is VALID [2022-04-15 04:31:00,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {2989#(<= ~counter~0 1)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2989#(<= ~counter~0 1)} is VALID [2022-04-15 04:31:00,327 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2989#(<= ~counter~0 1)} {2989#(<= ~counter~0 1)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2989#(<= ~counter~0 1)} is VALID [2022-04-15 04:31:00,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {2989#(<= ~counter~0 1)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2989#(<= ~counter~0 1)} is VALID [2022-04-15 04:31:00,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {2989#(<= ~counter~0 1)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3014#(<= ~counter~0 2)} is VALID [2022-04-15 04:31:00,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {3014#(<= ~counter~0 2)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3014#(<= ~counter~0 2)} is VALID [2022-04-15 04:31:00,328 INFO L272 TraceCheckUtils]: 22: Hoare triple {3014#(<= ~counter~0 2)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3014#(<= ~counter~0 2)} is VALID [2022-04-15 04:31:00,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {3014#(<= ~counter~0 2)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3014#(<= ~counter~0 2)} is VALID [2022-04-15 04:31:00,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {3014#(<= ~counter~0 2)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3014#(<= ~counter~0 2)} is VALID [2022-04-15 04:31:00,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {3014#(<= ~counter~0 2)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3014#(<= ~counter~0 2)} is VALID [2022-04-15 04:31:00,329 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3014#(<= ~counter~0 2)} {3014#(<= ~counter~0 2)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3014#(<= ~counter~0 2)} is VALID [2022-04-15 04:31:00,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {3014#(<= ~counter~0 2)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3014#(<= ~counter~0 2)} is VALID [2022-04-15 04:31:00,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {3014#(<= ~counter~0 2)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3039#(<= ~counter~0 3)} is VALID [2022-04-15 04:31:00,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {3039#(<= ~counter~0 3)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3039#(<= ~counter~0 3)} is VALID [2022-04-15 04:31:00,331 INFO L272 TraceCheckUtils]: 30: Hoare triple {3039#(<= ~counter~0 3)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3039#(<= ~counter~0 3)} is VALID [2022-04-15 04:31:00,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {3039#(<= ~counter~0 3)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3039#(<= ~counter~0 3)} is VALID [2022-04-15 04:31:00,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {3039#(<= ~counter~0 3)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3039#(<= ~counter~0 3)} is VALID [2022-04-15 04:31:00,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {3039#(<= ~counter~0 3)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3039#(<= ~counter~0 3)} is VALID [2022-04-15 04:31:00,332 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3039#(<= ~counter~0 3)} {3039#(<= ~counter~0 3)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3039#(<= ~counter~0 3)} is VALID [2022-04-15 04:31:00,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {3039#(<= ~counter~0 3)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3039#(<= ~counter~0 3)} is VALID [2022-04-15 04:31:00,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {3039#(<= ~counter~0 3)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3064#(<= ~counter~0 4)} is VALID [2022-04-15 04:31:00,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {3064#(<= ~counter~0 4)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3064#(<= ~counter~0 4)} is VALID [2022-04-15 04:31:00,334 INFO L272 TraceCheckUtils]: 38: Hoare triple {3064#(<= ~counter~0 4)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3064#(<= ~counter~0 4)} is VALID [2022-04-15 04:31:00,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {3064#(<= ~counter~0 4)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3064#(<= ~counter~0 4)} is VALID [2022-04-15 04:31:00,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {3064#(<= ~counter~0 4)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3064#(<= ~counter~0 4)} is VALID [2022-04-15 04:31:00,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {3064#(<= ~counter~0 4)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3064#(<= ~counter~0 4)} is VALID [2022-04-15 04:31:00,335 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3064#(<= ~counter~0 4)} {3064#(<= ~counter~0 4)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3064#(<= ~counter~0 4)} is VALID [2022-04-15 04:31:00,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {3064#(<= ~counter~0 4)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3064#(<= ~counter~0 4)} is VALID [2022-04-15 04:31:00,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {3064#(<= ~counter~0 4)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3089#(<= |main_#t~post5| 4)} is VALID [2022-04-15 04:31:00,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {3089#(<= |main_#t~post5| 4)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 10)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2948#false} is VALID [2022-04-15 04:31:00,336 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2948#false} is VALID [2022-04-15 04:31:00,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {2948#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2948#false} is VALID [2022-04-15 04:31:00,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {2948#false} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2948#false} is VALID [2022-04-15 04:31:00,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {2948#false} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2948#false} is VALID [2022-04-15 04:31:00,336 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2948#false} {2948#false} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2948#false} is VALID [2022-04-15 04:31:00,337 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2948#false} is VALID [2022-04-15 04:31:00,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2948#false} is VALID [2022-04-15 04:31:00,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2948#false} is VALID [2022-04-15 04:31:00,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2948#false} is VALID [2022-04-15 04:31:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 04:31:00,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:31:00,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2948#false} is VALID [2022-04-15 04:31:00,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2948#false} is VALID [2022-04-15 04:31:00,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2948#false} is VALID [2022-04-15 04:31:00,588 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2948#false} is VALID [2022-04-15 04:31:00,588 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2947#true} {2948#false} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2948#false} is VALID [2022-04-15 04:31:00,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {2947#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {2947#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {2947#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2947#true} is VALID [2022-04-15 04:31:00,588 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2947#true} is VALID [2022-04-15 04:31:00,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {3147#(< |main_#t~post5| 10)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 10)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2948#false} is VALID [2022-04-15 04:31:00,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {3151#(< ~counter~0 10)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3147#(< |main_#t~post5| 10)} is VALID [2022-04-15 04:31:00,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {3151#(< ~counter~0 10)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3151#(< ~counter~0 10)} is VALID [2022-04-15 04:31:00,590 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2947#true} {3151#(< ~counter~0 10)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3151#(< ~counter~0 10)} is VALID [2022-04-15 04:31:00,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {2947#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {2947#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {2947#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2947#true} is VALID [2022-04-15 04:31:00,591 INFO L272 TraceCheckUtils]: 38: Hoare triple {3151#(< ~counter~0 10)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2947#true} is VALID [2022-04-15 04:31:00,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {3151#(< ~counter~0 10)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3151#(< ~counter~0 10)} is VALID [2022-04-15 04:31:00,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {3176#(< ~counter~0 9)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3151#(< ~counter~0 10)} is VALID [2022-04-15 04:31:00,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {3176#(< ~counter~0 9)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3176#(< ~counter~0 9)} is VALID [2022-04-15 04:31:00,596 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2947#true} {3176#(< ~counter~0 9)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3176#(< ~counter~0 9)} is VALID [2022-04-15 04:31:00,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {2947#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {2947#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {2947#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2947#true} is VALID [2022-04-15 04:31:00,597 INFO L272 TraceCheckUtils]: 30: Hoare triple {3176#(< ~counter~0 9)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2947#true} is VALID [2022-04-15 04:31:00,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {3176#(< ~counter~0 9)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3176#(< ~counter~0 9)} is VALID [2022-04-15 04:31:00,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {3201#(< ~counter~0 8)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3176#(< ~counter~0 9)} is VALID [2022-04-15 04:31:00,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {3201#(< ~counter~0 8)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3201#(< ~counter~0 8)} is VALID [2022-04-15 04:31:00,598 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2947#true} {3201#(< ~counter~0 8)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3201#(< ~counter~0 8)} is VALID [2022-04-15 04:31:00,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {2947#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {2947#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {2947#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2947#true} is VALID [2022-04-15 04:31:00,598 INFO L272 TraceCheckUtils]: 22: Hoare triple {3201#(< ~counter~0 8)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2947#true} is VALID [2022-04-15 04:31:00,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {3201#(< ~counter~0 8)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3201#(< ~counter~0 8)} is VALID [2022-04-15 04:31:00,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {3226#(< ~counter~0 7)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3201#(< ~counter~0 8)} is VALID [2022-04-15 04:31:00,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {3226#(< ~counter~0 7)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3226#(< ~counter~0 7)} is VALID [2022-04-15 04:31:00,600 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2947#true} {3226#(< ~counter~0 7)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3226#(< ~counter~0 7)} is VALID [2022-04-15 04:31:00,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2947#true} is VALID [2022-04-15 04:31:00,600 INFO L272 TraceCheckUtils]: 14: Hoare triple {3226#(< ~counter~0 7)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2947#true} is VALID [2022-04-15 04:31:00,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {3226#(< ~counter~0 7)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3226#(< ~counter~0 7)} is VALID [2022-04-15 04:31:00,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {3251#(< ~counter~0 6)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3226#(< ~counter~0 7)} is VALID [2022-04-15 04:31:00,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {3251#(< ~counter~0 6)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {3251#(< ~counter~0 6)} is VALID [2022-04-15 04:31:00,604 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2947#true} {3251#(< ~counter~0 6)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3251#(< ~counter~0 6)} is VALID [2022-04-15 04:31:00,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {2947#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {2947#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {2947#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2947#true} is VALID [2022-04-15 04:31:00,605 INFO L272 TraceCheckUtils]: 6: Hoare triple {3251#(< ~counter~0 6)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2947#true} is VALID [2022-04-15 04:31:00,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#(< ~counter~0 6)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {3251#(< ~counter~0 6)} is VALID [2022-04-15 04:31:00,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {3251#(< ~counter~0 6)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3251#(< ~counter~0 6)} is VALID [2022-04-15 04:31:00,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3251#(< ~counter~0 6)} {2947#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3251#(< ~counter~0 6)} is VALID [2022-04-15 04:31:00,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#(< ~counter~0 6)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3251#(< ~counter~0 6)} is VALID [2022-04-15 04:31:00,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {3251#(< ~counter~0 6)} is VALID [2022-04-15 04:31:00,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2947#true} is VALID [2022-04-15 04:31:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 04:31:00,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:31:00,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703576171] [2022-04-15 04:31:00,607 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:31:00,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831875881] [2022-04-15 04:31:00,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831875881] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 04:31:00,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 04:31:00,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 04:31:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388247103] [2022-04-15 04:31:00,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 04:31:00,611 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-15 04:31:00,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:31:00,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 04:31:00,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:00,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 04:31:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:31:00,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 04:31:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 04:31:00,686 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 04:31:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:01,206 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-04-15 04:31:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 04:31:01,206 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-15 04:31:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:31:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 04:31:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-15 04:31:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 04:31:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-15 04:31:01,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 145 transitions. [2022-04-15 04:31:01,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:01,308 INFO L225 Difference]: With dead ends: 140 [2022-04-15 04:31:01,308 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 04:31:01,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-15 04:31:01,309 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 134 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:31:01,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 152 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:31:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 04:31:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2022-04-15 04:31:01,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:31:01,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 04:31:01,366 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 04:31:01,366 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 04:31:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:01,369 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-15 04:31:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-15 04:31:01,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:01,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:01,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-15 04:31:01,370 INFO L87 Difference]: Start difference. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-15 04:31:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:01,373 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-15 04:31:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-15 04:31:01,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:01,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:01,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:31:01,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:31:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 04:31:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-15 04:31:01,376 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 55 [2022-04-15 04:31:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:31:01,376 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-15 04:31:01,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 04:31:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-15 04:31:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 04:31:01,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:31:01,377 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:31:01,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 04:31:01,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 04:31:01,591 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:31:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:31:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1029628710, now seen corresponding path program 4 times [2022-04-15 04:31:01,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:31:01,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664004565] [2022-04-15 04:31:01,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:31:01,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:31:01,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:31:01,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899870545] [2022-04-15 04:31:01,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 04:31:01,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:31:01,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:31:01,603 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:31:01,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 04:31:01,639 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 04:31:01,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 04:31:01,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 04:31:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:31:01,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:31:02,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {3917#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {3917#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {3917#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3917#true} {3917#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {3917#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {3917#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {3917#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {3917#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {3917#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3917#true} {3917#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3917#true} is VALID [2022-04-15 04:31:02,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {3917#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:02,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:02,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:02,019 INFO L272 TraceCheckUtils]: 14: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-15 04:31:02,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {3917#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-15 04:31:02,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {3917#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {3917#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,019 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3917#true} {3955#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:02,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 04:31:02,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 04:31:02,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 04:31:02,021 INFO L272 TraceCheckUtils]: 22: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-15 04:31:02,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {3917#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-15 04:31:02,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {3917#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {3917#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,021 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3917#true} {3980#(and (= main_~y~0 1) (= main_~c~0 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 04:31:02,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-15 04:31:02,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-15 04:31:02,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-15 04:31:02,023 INFO L272 TraceCheckUtils]: 30: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-15 04:31:02,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {3917#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-15 04:31:02,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {3917#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {3917#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,023 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3917#true} {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-15 04:31:02,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-15 04:31:02,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-15 04:31:02,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-15 04:31:02,025 INFO L272 TraceCheckUtils]: 38: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-15 04:31:02,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {3917#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-15 04:31:02,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {3917#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,025 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3917#true} {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-15 04:31:02,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 04:31:02,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 04:31:02,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 04:31:02,027 INFO L272 TraceCheckUtils]: 46: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-15 04:31:02,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {3917#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-15 04:31:02,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {3917#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {3917#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,027 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3917#true} {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 04:31:02,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 04:31:02,028 INFO L272 TraceCheckUtils]: 52: Hoare triple {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-15 04:31:02,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {3917#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-15 04:31:02,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {3917#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {3917#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-15 04:31:02,029 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3917#true} {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 04:31:02,031 INFO L272 TraceCheckUtils]: 57: Hoare triple {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4099#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:31:02,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {4099#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4103#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:31:02,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {4103#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3918#false} is VALID [2022-04-15 04:31:02,032 INFO L290 TraceCheckUtils]: 60: Hoare triple {3918#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3918#false} is VALID [2022-04-15 04:31:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 04:31:02,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:31:02,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:31:02,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664004565] [2022-04-15 04:31:02,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:31:02,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899870545] [2022-04-15 04:31:02,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899870545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 04:31:02,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:31:02,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-15 04:31:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328183008] [2022-04-15 04:31:02,368 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 04:31:02,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-15 04:31:02,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:31:02,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 04:31:02,402 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-15 04:31:02,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 04:31:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:31:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 04:31:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 04:31:02,403 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 04:31:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:02,877 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-15 04:31:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 04:31:02,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-15 04:31:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:31:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 04:31:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 04:31:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 04:31:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 04:31:02,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-15 04:31:02,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:02,932 INFO L225 Difference]: With dead ends: 110 [2022-04-15 04:31:02,932 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 04:31:02,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-15 04:31:02,933 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 04:31:02,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 267 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 04:31:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 04:31:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-04-15 04:31:02,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:31:02,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 04:31:02,976 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 04:31:02,976 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 04:31:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:02,978 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-15 04:31:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-15 04:31:02,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:02,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:02,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-15 04:31:02,978 INFO L87 Difference]: Start difference. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-15 04:31:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:02,980 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-15 04:31:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-15 04:31:02,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:02,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:02,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:31:02,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:31:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 04:31:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-04-15 04:31:02,982 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 61 [2022-04-15 04:31:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:31:02,983 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-04-15 04:31:02,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 04:31:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-15 04:31:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 04:31:02,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:31:02,983 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:31:03,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 04:31:03,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 04:31:03,194 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:31:03,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:31:03,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1176886980, now seen corresponding path program 5 times [2022-04-15 04:31:03,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:31:03,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837844209] [2022-04-15 04:31:03,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:31:03,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:31:03,206 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:31:03,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [699862947] [2022-04-15 04:31:03,206 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-15 04:31:03,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:31:03,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:31:03,207 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:31:03,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 04:31:05,008 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-15 04:31:05,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 04:31:05,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 04:31:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:31:05,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:31:05,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {4686#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {4686#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {4686#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4686#true} {4686#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {4686#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {4686#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {4686#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {4686#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {4686#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {4686#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4686#true} {4686#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {4686#true} is VALID [2022-04-15 04:31:05,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {4686#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:05,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:05,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:05,518 INFO L272 TraceCheckUtils]: 14: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4686#true} is VALID [2022-04-15 04:31:05,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {4686#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4686#true} is VALID [2022-04-15 04:31:05,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {4686#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {4686#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,518 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4686#true} {4724#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:05,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 04:31:05,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 04:31:05,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 04:31:05,520 INFO L272 TraceCheckUtils]: 22: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4686#true} is VALID [2022-04-15 04:31:05,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {4686#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4686#true} is VALID [2022-04-15 04:31:05,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {4686#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {4686#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,521 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4686#true} {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 04:31:05,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:05,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:05,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:05,522 INFO L272 TraceCheckUtils]: 30: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4686#true} is VALID [2022-04-15 04:31:05,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {4686#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4686#true} is VALID [2022-04-15 04:31:05,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {4686#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {4686#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,525 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4686#true} {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:05,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-15 04:31:05,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-15 04:31:05,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-15 04:31:05,526 INFO L272 TraceCheckUtils]: 38: Hoare triple {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4686#true} is VALID [2022-04-15 04:31:05,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {4686#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4686#true} is VALID [2022-04-15 04:31:05,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {4686#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {4686#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,527 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4686#true} {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-15 04:31:05,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {4799#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:05,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:05,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:05,528 INFO L272 TraceCheckUtils]: 46: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4686#true} is VALID [2022-04-15 04:31:05,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {4686#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4686#true} is VALID [2022-04-15 04:31:05,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {4686#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {4686#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,529 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4686#true} {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:05,530 INFO L290 TraceCheckUtils]: 51: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-15 04:31:05,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-15 04:31:05,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-15 04:31:05,531 INFO L272 TraceCheckUtils]: 54: Hoare triple {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4686#true} is VALID [2022-04-15 04:31:05,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {4686#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4686#true} is VALID [2022-04-15 04:31:05,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {4686#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {4686#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,532 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4686#true} {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-15 04:31:05,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {4849#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {4874#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-15 04:31:05,532 INFO L272 TraceCheckUtils]: 60: Hoare triple {4874#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4686#true} is VALID [2022-04-15 04:31:05,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {4686#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4686#true} is VALID [2022-04-15 04:31:05,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {4686#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {4686#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4686#true} is VALID [2022-04-15 04:31:05,551 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4686#true} {4874#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4874#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-15 04:31:05,551 INFO L272 TraceCheckUtils]: 65: Hoare triple {4874#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:31:05,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {4893#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:31:05,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {4897#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4687#false} is VALID [2022-04-15 04:31:05,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {4687#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4687#false} is VALID [2022-04-15 04:31:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 04:31:05,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:31:06,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:31:06,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837844209] [2022-04-15 04:31:06,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:31:06,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699862947] [2022-04-15 04:31:06,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699862947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 04:31:06,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:31:06,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 04:31:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387779588] [2022-04-15 04:31:06,333 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 04:31:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-15 04:31:06,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:31:06,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 04:31:06,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:06,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 04:31:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:31:06,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 04:31:06,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-15 04:31:06,377 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 04:31:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:06,943 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-04-15 04:31:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 04:31:06,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-15 04:31:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:31:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 04:31:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-15 04:31:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 04:31:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-15 04:31:06,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-15 04:31:06,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:06,999 INFO L225 Difference]: With dead ends: 109 [2022-04-15 04:31:06,999 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 04:31:06,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-15 04:31:07,000 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 04:31:07,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 04:31:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 04:31:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-15 04:31:07,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:31:07,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 04:31:07,046 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 04:31:07,046 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 04:31:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:07,048 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-15 04:31:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-15 04:31:07,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:07,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:07,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-15 04:31:07,048 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-15 04:31:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:07,050 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-15 04:31:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-15 04:31:07,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:07,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:07,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:31:07,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:31:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 04:31:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-04-15 04:31:07,066 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 69 [2022-04-15 04:31:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:31:07,066 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-04-15 04:31:07,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 04:31:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-15 04:31:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 04:31:07,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:31:07,067 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:31:07,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 04:31:07,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 04:31:07,275 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:31:07,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:31:07,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1006740382, now seen corresponding path program 6 times [2022-04-15 04:31:07,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:31:07,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243574897] [2022-04-15 04:31:07,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:31:07,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:31:07,308 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:31:07,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881114527] [2022-04-15 04:31:07,308 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 04:31:07,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:31:07,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:31:07,316 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:31:07,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 04:31:24,235 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 04:31:24,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 04:31:24,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 04:31:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:31:24,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:31:24,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {5574#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {5574#true} is VALID [2022-04-15 04:31:24,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {5574#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5574#true} {5574#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {5574#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {5574#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {5574#true} is VALID [2022-04-15 04:31:24,671 INFO L272 TraceCheckUtils]: 6: Hoare triple {5574#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {5574#true} is VALID [2022-04-15 04:31:24,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {5574#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5574#true} is VALID [2022-04-15 04:31:24,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {5574#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {5574#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5574#true} {5574#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {5574#true} is VALID [2022-04-15 04:31:24,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {5574#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {5612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:24,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {5612#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:24,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {5612#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:24,673 INFO L272 TraceCheckUtils]: 14: Hoare triple {5612#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5574#true} is VALID [2022-04-15 04:31:24,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {5574#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5574#true} is VALID [2022-04-15 04:31:24,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {5574#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {5574#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,673 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5574#true} {5612#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5612#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:24,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {5612#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5637#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 04:31:24,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {5637#(and (= main_~y~0 1) (= main_~c~0 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5637#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 04:31:24,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#(and (= main_~y~0 1) (= main_~c~0 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5637#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 04:31:24,675 INFO L272 TraceCheckUtils]: 22: Hoare triple {5637#(and (= main_~y~0 1) (= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5574#true} is VALID [2022-04-15 04:31:24,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {5574#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5574#true} is VALID [2022-04-15 04:31:24,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {5574#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {5574#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,675 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5574#true} {5637#(and (= main_~y~0 1) (= main_~c~0 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5637#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 04:31:24,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#(and (= main_~y~0 1) (= main_~c~0 1))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 04:31:24,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 04:31:24,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 04:31:24,677 INFO L272 TraceCheckUtils]: 30: Hoare triple {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5574#true} is VALID [2022-04-15 04:31:24,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {5574#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5574#true} is VALID [2022-04-15 04:31:24,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {5574#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {5574#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,678 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5574#true} {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 04:31:24,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {5662#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 04:31:24,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 04:31:24,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 04:31:24,679 INFO L272 TraceCheckUtils]: 38: Hoare triple {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5574#true} is VALID [2022-04-15 04:31:24,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {5574#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5574#true} is VALID [2022-04-15 04:31:24,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {5574#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {5574#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,680 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5574#true} {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 04:31:24,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {5687#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-15 04:31:24,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-15 04:31:24,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-15 04:31:24,682 INFO L272 TraceCheckUtils]: 46: Hoare triple {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5574#true} is VALID [2022-04-15 04:31:24,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {5574#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5574#true} is VALID [2022-04-15 04:31:24,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {5574#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {5574#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,683 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5574#true} {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-15 04:31:24,683 INFO L290 TraceCheckUtils]: 51: Hoare triple {5712#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 04:31:24,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 04:31:24,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 04:31:24,685 INFO L272 TraceCheckUtils]: 54: Hoare triple {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5574#true} is VALID [2022-04-15 04:31:24,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {5574#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5574#true} is VALID [2022-04-15 04:31:24,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {5574#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {5574#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,685 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5574#true} {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 04:31:24,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {5737#(and (= 5 main_~c~0) (= 5 main_~y~0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 04:31:24,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 04:31:24,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 04:31:24,687 INFO L272 TraceCheckUtils]: 62: Hoare triple {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5574#true} is VALID [2022-04-15 04:31:24,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {5574#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5574#true} is VALID [2022-04-15 04:31:24,687 INFO L290 TraceCheckUtils]: 64: Hoare triple {5574#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {5574#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,688 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5574#true} {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 04:31:24,689 INFO L290 TraceCheckUtils]: 67: Hoare triple {5762#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {5787#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-15 04:31:24,689 INFO L272 TraceCheckUtils]: 68: Hoare triple {5787#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5574#true} is VALID [2022-04-15 04:31:24,689 INFO L290 TraceCheckUtils]: 69: Hoare triple {5574#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5574#true} is VALID [2022-04-15 04:31:24,689 INFO L290 TraceCheckUtils]: 70: Hoare triple {5574#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {5574#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5574#true} is VALID [2022-04-15 04:31:24,689 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5574#true} {5787#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5787#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-15 04:31:24,690 INFO L272 TraceCheckUtils]: 73: Hoare triple {5787#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {5806#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:31:24,691 INFO L290 TraceCheckUtils]: 74: Hoare triple {5806#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5810#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:31:24,691 INFO L290 TraceCheckUtils]: 75: Hoare triple {5810#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5575#false} is VALID [2022-04-15 04:31:24,691 INFO L290 TraceCheckUtils]: 76: Hoare triple {5575#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5575#false} is VALID [2022-04-15 04:31:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 04:31:24,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:31:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:31:24,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243574897] [2022-04-15 04:31:24,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:31:24,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881114527] [2022-04-15 04:31:24,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881114527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 04:31:24,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:31:24,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-15 04:31:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363737878] [2022-04-15 04:31:24,969 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 04:31:24,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-15 04:31:24,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:31:24,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 04:31:25,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:25,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 04:31:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:31:25,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 04:31:25,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 04:31:25,022 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 04:31:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:25,665 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-04-15 04:31:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 04:31:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-15 04:31:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:31:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 04:31:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 04:31:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 04:31:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 04:31:25,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-15 04:31:25,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:25,723 INFO L225 Difference]: With dead ends: 108 [2022-04-15 04:31:25,723 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 04:31:25,724 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-15 04:31:25,724 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 04:31:25,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 371 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 04:31:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 04:31:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-15 04:31:25,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:31:25,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 04:31:25,769 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 04:31:25,769 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 04:31:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:25,771 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-15 04:31:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-15 04:31:25,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:25,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:25,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-15 04:31:25,779 INFO L87 Difference]: Start difference. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-15 04:31:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:25,781 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-15 04:31:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-15 04:31:25,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:25,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:25,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:31:25,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:31:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 04:31:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-04-15 04:31:25,785 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 77 [2022-04-15 04:31:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:31:25,785 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-04-15 04:31:25,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 04:31:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-15 04:31:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 04:31:25,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:31:25,786 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:31:25,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 04:31:25,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 04:31:25,991 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:31:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:31:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash -700032000, now seen corresponding path program 7 times [2022-04-15 04:31:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:31:25,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407505998] [2022-04-15 04:31:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:31:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:31:26,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:31:26,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130520441] [2022-04-15 04:31:26,021 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-15 04:31:26,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:31:26,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:31:26,024 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:31:26,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 04:31:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:31:38,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 04:31:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:31:38,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:31:38,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {6381#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {6381#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {6381#true} is VALID [2022-04-15 04:31:38,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {6381#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6381#true} {6381#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {6381#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {6381#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:38,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {6381#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {6381#true} is VALID [2022-04-15 04:31:38,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {6381#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6381#true} is VALID [2022-04-15 04:31:38,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {6381#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {6381#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6381#true} {6381#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {6381#true} is VALID [2022-04-15 04:31:38,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {6381#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:38,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:38,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:38,993 INFO L272 TraceCheckUtils]: 14: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:38,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {6381#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6381#true} is VALID [2022-04-15 04:31:38,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {6381#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {6381#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,994 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6381#true} {6419#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:38,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 04:31:38,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 04:31:38,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 04:31:38,995 INFO L272 TraceCheckUtils]: 22: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:38,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {6381#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6381#true} is VALID [2022-04-15 04:31:38,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {6381#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {6381#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,996 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6381#true} {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 04:31:38,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 04:31:38,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 04:31:38,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 04:31:38,998 INFO L272 TraceCheckUtils]: 30: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:38,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {6381#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6381#true} is VALID [2022-04-15 04:31:38,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {6381#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:38,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {6381#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,001 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6381#true} {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 04:31:39,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-15 04:31:39,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-15 04:31:39,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-15 04:31:39,003 INFO L272 TraceCheckUtils]: 38: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:39,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {6381#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6381#true} is VALID [2022-04-15 04:31:39,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {6381#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {6381#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,004 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6381#true} {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-15 04:31:39,004 INFO L290 TraceCheckUtils]: 43: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,005 INFO L290 TraceCheckUtils]: 45: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,005 INFO L272 TraceCheckUtils]: 46: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:39,005 INFO L290 TraceCheckUtils]: 47: Hoare triple {6381#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6381#true} is VALID [2022-04-15 04:31:39,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {6381#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {6381#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,006 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6381#true} {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,006 INFO L290 TraceCheckUtils]: 51: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,007 INFO L272 TraceCheckUtils]: 54: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:39,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {6381#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6381#true} is VALID [2022-04-15 04:31:39,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {6381#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {6381#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,008 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6381#true} {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,009 INFO L272 TraceCheckUtils]: 62: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:39,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {6381#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6381#true} is VALID [2022-04-15 04:31:39,009 INFO L290 TraceCheckUtils]: 64: Hoare triple {6381#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {6381#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,010 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6381#true} {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-15 04:31:39,010 INFO L290 TraceCheckUtils]: 67: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 04:31:39,011 INFO L290 TraceCheckUtils]: 68: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 04:31:39,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 04:31:39,011 INFO L272 TraceCheckUtils]: 70: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:39,011 INFO L290 TraceCheckUtils]: 71: Hoare triple {6381#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6381#true} is VALID [2022-04-15 04:31:39,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {6381#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {6381#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,012 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6381#true} {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 04:31:39,013 INFO L290 TraceCheckUtils]: 75: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 04:31:39,013 INFO L272 TraceCheckUtils]: 76: Hoare triple {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6381#true} is VALID [2022-04-15 04:31:39,013 INFO L290 TraceCheckUtils]: 77: Hoare triple {6381#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6381#true} is VALID [2022-04-15 04:31:39,013 INFO L290 TraceCheckUtils]: 78: Hoare triple {6381#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,013 INFO L290 TraceCheckUtils]: 79: Hoare triple {6381#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6381#true} is VALID [2022-04-15 04:31:39,014 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6381#true} {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 04:31:39,015 INFO L272 TraceCheckUtils]: 81: Hoare triple {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {6638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:31:39,015 INFO L290 TraceCheckUtils]: 82: Hoare triple {6638#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:31:39,016 INFO L290 TraceCheckUtils]: 83: Hoare triple {6642#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6382#false} is VALID [2022-04-15 04:31:39,016 INFO L290 TraceCheckUtils]: 84: Hoare triple {6382#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6382#false} is VALID [2022-04-15 04:31:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 04:31:39,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:31:39,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:31:39,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407505998] [2022-04-15 04:31:39,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:31:39,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130520441] [2022-04-15 04:31:39,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130520441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 04:31:39,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:31:39,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 04:31:39,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758334836] [2022-04-15 04:31:39,868 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 04:31:39,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-15 04:31:39,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:31:39,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 04:31:39,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:39,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 04:31:39,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:31:39,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 04:31:39,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-15 04:31:39,913 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 04:31:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:40,750 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-04-15 04:31:40,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 04:31:40,751 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-15 04:31:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:31:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 04:31:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-15 04:31:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 04:31:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-15 04:31:40,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-15 04:31:40,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:40,805 INFO L225 Difference]: With dead ends: 107 [2022-04-15 04:31:40,805 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 04:31:40,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-15 04:31:40,805 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 04:31:40,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 423 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 04:31:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 04:31:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-15 04:31:40,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:31:40,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 04:31:40,860 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 04:31:40,860 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 04:31:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:40,861 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-15 04:31:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-15 04:31:40,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:40,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:40,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-15 04:31:40,862 INFO L87 Difference]: Start difference. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-15 04:31:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:40,864 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-15 04:31:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-15 04:31:40,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:40,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:40,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:31:40,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:31:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 04:31:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-04-15 04:31:40,866 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 85 [2022-04-15 04:31:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:31:40,866 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-04-15 04:31:40,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 04:31:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-15 04:31:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 04:31:40,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:31:40,871 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:31:40,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 04:31:41,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 04:31:41,075 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:31:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:31:41,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1583078814, now seen corresponding path program 8 times [2022-04-15 04:31:41,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:31:41,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243415129] [2022-04-15 04:31:41,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:31:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:31:41,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:31:41,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [372489664] [2022-04-15 04:31:41,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 04:31:41,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:31:41,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:31:41,088 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:31:41,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 04:31:46,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 04:31:46,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 04:31:46,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 04:31:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 04:31:46,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 04:31:47,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {7357#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {7357#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 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{~counter~0=v_~counter~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[~counter~0, #NULL.offset, #NULL.base] {7357#true} is VALID [2022-04-15 04:31:47,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {7357#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7357#true} {7357#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {7357#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {7357#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {7357#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {7357#true} is VALID [2022-04-15 04:31:47,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {7357#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {7357#true} is VALID [2022-04-15 04:31:47,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {7357#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {7357#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,339 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7357#true} {7357#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {7357#true} is VALID [2022-04-15 04:31:47,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {7357#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:47,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:47,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:47,340 INFO L272 TraceCheckUtils]: 14: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,341 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7357#true} {7395#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 04:31:47,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 04:31:47,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 04:31:47,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 04:31:47,342 INFO L272 TraceCheckUtils]: 22: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,343 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7357#true} {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 04:31:47,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 04:31:47,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 04:31:47,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 04:31:47,344 INFO L272 TraceCheckUtils]: 30: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,345 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7357#true} {7445#(and (= main_~y~0 2) (= main_~c~0 2))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 04:31:47,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 04:31:47,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 04:31:47,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 04:31:47,346 INFO L272 TraceCheckUtils]: 38: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,347 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7357#true} {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 04:31:47,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 04:31:47,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 04:31:47,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 04:31:47,349 INFO L272 TraceCheckUtils]: 46: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,349 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7357#true} {7495#(and (= main_~y~0 4) (= main_~c~0 4))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 04:31:47,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-15 04:31:47,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-15 04:31:47,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-15 04:31:47,351 INFO L272 TraceCheckUtils]: 54: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,351 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7357#true} {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-15 04:31:47,352 INFO L290 TraceCheckUtils]: 59: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 04:31:47,352 INFO L290 TraceCheckUtils]: 60: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 04:31:47,353 INFO L290 TraceCheckUtils]: 61: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 04:31:47,353 INFO L272 TraceCheckUtils]: 62: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,353 INFO L290 TraceCheckUtils]: 63: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,353 INFO L290 TraceCheckUtils]: 64: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,353 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7357#true} {7545#(and (= main_~y~0 6) (= main_~c~0 6))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 04:31:47,354 INFO L290 TraceCheckUtils]: 67: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-15 04:31:47,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-15 04:31:47,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-15 04:31:47,355 INFO L272 TraceCheckUtils]: 70: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,355 INFO L290 TraceCheckUtils]: 71: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,355 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7357#true} {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-15 04:31:47,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= (+ v_main_~x~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_5) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 04:31:47,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 04:31:47,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 10) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 04:31:47,357 INFO L272 TraceCheckUtils]: 78: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,357 INFO L290 TraceCheckUtils]: 79: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,357 INFO L290 TraceCheckUtils]: 80: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,357 INFO L290 TraceCheckUtils]: 81: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,357 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {7357#true} {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 04:31:47,358 INFO L290 TraceCheckUtils]: 83: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-15 04:31:47,358 INFO L272 TraceCheckUtils]: 84: Hoare triple {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7357#true} is VALID [2022-04-15 04:31:47,358 INFO L290 TraceCheckUtils]: 85: Hoare triple {7357#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7357#true} is VALID [2022-04-15 04:31:47,358 INFO L290 TraceCheckUtils]: 86: Hoare triple {7357#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,358 INFO L290 TraceCheckUtils]: 87: Hoare triple {7357#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7357#true} is VALID [2022-04-15 04:31:47,359 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7357#true} {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 10))) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (* (- 1) v_main_~y~0_9) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 15))) v_main_~y~0_9) (* v_main_~x~0_8 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-15 04:31:47,359 INFO L272 TraceCheckUtils]: 89: Hoare triple {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {7639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 04:31:47,360 INFO L290 TraceCheckUtils]: 90: Hoare triple {7639#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 04:31:47,360 INFO L290 TraceCheckUtils]: 91: Hoare triple {7643#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7358#false} is VALID [2022-04-15 04:31:47,360 INFO L290 TraceCheckUtils]: 92: Hoare triple {7358#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7358#false} is VALID [2022-04-15 04:31:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 04:31:47,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 04:31:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 04:31:47,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243415129] [2022-04-15 04:31:47,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 04:31:47,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372489664] [2022-04-15 04:31:47,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372489664] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 04:31:47,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 04:31:47,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-15 04:31:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958340348] [2022-04-15 04:31:47,634 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-15 04:31:47,634 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-15 04:31:47,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 04:31:47,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 04:31:47,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:47,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 04:31:47,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 04:31:47,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 04:31:47,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 04:31:47,694 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 04:31:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:48,631 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2022-04-15 04:31:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 04:31:48,631 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-15 04:31:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 04:31:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 04:31:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-15 04:31:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 04:31:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-15 04:31:48,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-15 04:31:48,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 04:31:48,690 INFO L225 Difference]: With dead ends: 106 [2022-04-15 04:31:48,690 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 04:31:48,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-15 04:31:48,691 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 04:31:48,691 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 04:31:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 04:31:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-15 04:31:48,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 04:31:48,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 04:31:48,744 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 04:31:48,744 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 04:31:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:48,746 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-15 04:31:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-15 04:31:48,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:48,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:48,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-15 04:31:48,747 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-15 04:31:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 04:31:48,749 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-15 04:31:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-15 04:31:48,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 04:31:48,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 04:31:48,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 04:31:48,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 04:31:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 04:31:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-15 04:31:48,751 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2022-04-15 04:31:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 04:31:48,751 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-15 04:31:48,751 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 04:31:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-15 04:31:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 04:31:48,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 04:31:48,752 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 04:31:48,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 04:31:48,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 04:31:48,959 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 04:31:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 04:31:48,960 INFO L85 PathProgramCache]: Analyzing trace with hash -6495940, now seen corresponding path program 9 times [2022-04-15 04:31:48,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 04:31:48,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593380707] [2022-04-15 04:31:48,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 04:31:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 04:31:48,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 04:31:48,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112018044] [2022-04-15 04:31:48,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 04:31:48,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 04:31:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 04:31:48,981 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 04:31:48,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process