/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 20:04:58,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 20:04:58,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 20:04:58,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 20:04:58,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 20:04:58,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 20:04:58,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 20:04:58,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 20:04:58,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 20:04:58,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 20:04:58,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 20:04:58,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 20:04:58,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 20:04:58,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 20:04:58,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 20:04:58,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 20:04:58,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 20:04:58,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 20:04:58,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 20:04:58,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 20:04:58,278 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 20:04:58,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 20:04:58,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 20:04:58,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 20:04:58,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 20:04:58,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 20:04:58,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 20:04:58,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 20:04:58,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 20:04:58,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 20:04:58,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 20:04:58,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 20:04:58,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 20:04:58,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 20:04:58,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 20:04:58,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 20:04:58,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 20:04:58,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 20:04:58,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 20:04:58,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 20:04:58,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 20:04:58,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 20:04:58,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 20:04:58,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 20:04:58,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 20:04:58,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 20:04:58,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 20:04:58,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 20:04:58,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 20:04:58,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 20:04:58,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 20:04:58,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 20:04:58,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 20:04:58,314 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 20:04:58,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 20:04:58,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 20:04:58,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 20:04:58,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 20:04:58,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 20:04:58,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 20:04:58,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 20:04:58,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:04:58,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 20:04:58,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 20:04:58,317 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 20:04:58,317 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 20:04:58,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 20:04:58,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 20:04:58,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 20:04:58,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 20:04:58,529 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 20:04:58,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2022-04-27 20:04:58,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef64d2b18/56f1126491ad4c7aba53978b6c67a0a3/FLAGfa6d1a1a4 [2022-04-27 20:04:58,931 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 20:04:58,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2022-04-27 20:04:58,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef64d2b18/56f1126491ad4c7aba53978b6c67a0a3/FLAGfa6d1a1a4 [2022-04-27 20:04:58,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef64d2b18/56f1126491ad4c7aba53978b6c67a0a3 [2022-04-27 20:04:58,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 20:04:58,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 20:04:58,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 20:04:58,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 20:04:58,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 20:04:58,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:04:58" (1/1) ... [2022-04-27 20:04:58,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91729b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:58, skipping insertion in model container [2022-04-27 20:04:58,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:04:58" (1/1) ... [2022-04-27 20:04:58,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 20:04:58,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 20:04:59,139 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_valuebound10.c[458,471] [2022-04-27 20:04:59,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:04:59,174 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 20:04:59,184 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_valuebound10.c[458,471] [2022-04-27 20:04:59,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:04:59,211 INFO L208 MainTranslator]: Completed translation [2022-04-27 20:04:59,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59 WrapperNode [2022-04-27 20:04:59,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 20:04:59,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 20:04:59,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 20:04:59,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 20:04:59,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59" (1/1) ... [2022-04-27 20:04:59,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59" (1/1) ... [2022-04-27 20:04:59,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59" (1/1) ... [2022-04-27 20:04:59,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59" (1/1) ... [2022-04-27 20:04:59,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59" (1/1) ... [2022-04-27 20:04:59,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59" (1/1) ... [2022-04-27 20:04:59,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59" (1/1) ... [2022-04-27 20:04:59,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 20:04:59,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 20:04:59,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 20:04:59,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 20:04:59,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59" (1/1) ... [2022-04-27 20:04:59,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:04:59,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:04:59,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 20:04:59,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 20:04:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 20:04:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 20:04:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 20:04:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 20:04:59,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 20:04:59,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 20:04:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 20:04:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 20:04:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 20:04:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 20:04:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 20:04:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 20:04:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 20:04:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 20:04:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 20:04:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 20:04:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 20:04:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 20:04:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 20:04:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 20:04:59,353 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 20:04:59,354 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 20:04:59,481 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 20:04:59,485 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 20:04:59,485 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 20:04:59,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:04:59 BoogieIcfgContainer [2022-04-27 20:04:59,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 20:04:59,487 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 20:04:59,492 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 20:04:59,494 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 20:04:59,496 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:04:59" (1/1) ... [2022-04-27 20:04:59,498 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 20:04:59,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:04:59 BasicIcfg [2022-04-27 20:04:59,522 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 20:04:59,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 20:04:59,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 20:04:59,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 20:04:59,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 08:04:58" (1/4) ... [2022-04-27 20:04:59,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d384f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:04:59, skipping insertion in model container [2022-04-27 20:04:59,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:04:59" (2/4) ... [2022-04-27 20:04:59,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d384f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:04:59, skipping insertion in model container [2022-04-27 20:04:59,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:04:59" (3/4) ... [2022-04-27 20:04:59,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d384f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:04:59, skipping insertion in model container [2022-04-27 20:04:59,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:04:59" (4/4) ... [2022-04-27 20:04:59,529 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound10.cJordan [2022-04-27 20:04:59,537 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 20:04:59,537 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 20:04:59,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 20:04:59,570 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58a9877f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5335016c [2022-04-27 20:04:59,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 20:04:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:04:59,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 20:04:59,579 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:04:59,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:04:59,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:04:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:04:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1187991702, now seen corresponding path program 1 times [2022-04-27 20:04:59,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:04:59,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906222944] [2022-04-27 20:04:59,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:04:59,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:04:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:04:59,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:04:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:04:59,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 20:04:59,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:04:59,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:04:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 20:04:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:04:59,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] 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-27 20:04:59,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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-27 20:04:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 20:04:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:04:59,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] 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-27 20:04:59,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-27 20:04:59,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:04:59,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 20:04:59,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:04:59,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:04:59,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:04:59,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [70] mainENTRY-->L21: 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-27 20:04:59,787 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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-27 20:04:59,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [74] 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-27 20:04:59,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,788 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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-27 20:04:59,788 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-27 20:04:59,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} [74] 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-27 20:04:59,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,791 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-27 20:04:59,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} [75] L22-->L28-2: 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-27 20:04:59,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,793 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} [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] {33#false} is VALID [2022-04-27 20:04:59,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} [85] __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-27 20:04:59,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} [89] 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-27 20:04:59,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:04:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 20:04:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:04:59,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906222944] [2022-04-27 20:04:59,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906222944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:04:59,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:04:59,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 20:04:59,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183739524] [2022-04-27 20:04:59,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:04:59,802 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 20:04:59,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:04:59,806 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:04:59,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:04:59,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 20:04:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:04:59,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 20:04:59,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 20:04:59,850 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:04:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:04:59,947 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 20:04:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 20:04:59,948 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 20:04:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:04:59,949 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:04:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 20:04:59,953 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:04:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 20:04:59,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-27 20:05:00,000 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-27 20:05:00,008 INFO L225 Difference]: With dead ends: 29 [2022-04-27 20:05:00,008 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 20:05:00,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 20:05:00,012 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:05:00,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:05:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 20:05:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 20:05:00,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:05:00,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:05:00,030 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:05:00,030 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:05:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:05:00,033 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 20:05:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 20:05:00,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:05:00,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:05:00,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 20:05:00,034 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-27 20:05:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:05:00,037 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 20:05:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 20:05:00,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:05:00,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:05:00,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:05:00,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:05:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:05:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 20:05:00,040 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-27 20:05:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:05:00,040 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 20:05:00,040 INFO L496 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:05:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 20:05:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 20:05:00,041 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:05:00,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:05:00,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 20:05:00,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:05:00,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:05:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash 793962506, now seen corresponding path program 1 times [2022-04-27 20:05:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:05:00,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993729200] [2022-04-27 20:05:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:05:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:05:00,064 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:05:00,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683574378] [2022-04-27 20:05:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:05:00,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:05:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:05:00,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:05:00,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 20:05:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:05:00,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 20:05:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:05:00,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:05:00,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 20:05:00,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {149#true} is VALID [2022-04-27 20:05:00,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 20:05:00,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 20:05:00,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 20:05:00,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} [70] mainENTRY-->L21: 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] {149#true} is VALID [2022-04-27 20:05:00,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {149#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {149#true} is VALID [2022-04-27 20:05:00,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {149#true} [74] 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] {149#true} is VALID [2022-04-27 20:05:00,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {149#true} [77] 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[] {149#true} is VALID [2022-04-27 20:05:00,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {149#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 20:05:00,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {149#true} {149#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {149#true} is VALID [2022-04-27 20:05:00,286 INFO L272 TraceCheckUtils]: 11: Hoare triple {149#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-27 20:05:00,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {149#true} [74] 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] {149#true} is VALID [2022-04-27 20:05:00,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#true} [77] 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[] {149#true} is VALID [2022-04-27 20:05:00,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {149#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#true} is VALID [2022-04-27 20:05:00,290 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {149#true} {149#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {149#true} is VALID [2022-04-27 20:05:00,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {149#true} [75] L22-->L28-2: 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] {202#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:05:00,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {202#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:05:00,292 INFO L272 TraceCheckUtils]: 18: Hoare triple {202#(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] {209#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:05:00,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {209#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {213#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:05:00,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {213#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {150#false} is VALID [2022-04-27 20:05:00,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {150#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#false} is VALID [2022-04-27 20:05:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 20:05:00,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 20:05:00,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:05:00,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993729200] [2022-04-27 20:05:00,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:05:00,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683574378] [2022-04-27 20:05:00,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683574378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:05:00,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:05:00,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 20:05:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791368648] [2022-04-27 20:05:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:05:00,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 20:05:00,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:05:00,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 20:05:00,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:05:00,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 20:05:00,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:05:00,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 20:05:00,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:05:00,316 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 20:05:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:05:00,613 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-27 20:05:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 20:05:00,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 20:05:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:05:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 20:05:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-27 20:05:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 20:05:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-27 20:05:00,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-27 20:05:00,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:05:00,651 INFO L225 Difference]: With dead ends: 33 [2022-04-27 20:05:00,651 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 20:05:00,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-27 20:05:00,652 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:05:00,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:05:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 20:05:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 20:05:00,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:05:00,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:05:00,656 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:05:00,656 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:05:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:05:00,658 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 20:05:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 20:05:00,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:05:00,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:05:00,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 20:05:00,659 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-27 20:05:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:05:00,675 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 20:05:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 20:05:00,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:05:00,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:05:00,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:05:00,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:05:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:05:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 20:05:00,678 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-27 20:05:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:05:00,678 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 20:05:00,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 20:05:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 20:05:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 20:05:00,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:05:00,679 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:05:00,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 20:05:00,901 WARN L477 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-27 20:05:00,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:05:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:05:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash -503871754, now seen corresponding path program 1 times [2022-04-27 20:05:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:05:00,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394043819] [2022-04-27 20:05:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:05:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:05:00,915 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:05:00,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140865873] [2022-04-27 20:05:00,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:05:00,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:05:00,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:05:00,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:05:00,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 20:05:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:05:00,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 20:05:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:05:00,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:05:01,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:01,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {347#true} is VALID [2022-04-27 20:05:01,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:01,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:01,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:01,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} [70] mainENTRY-->L21: 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] {347#true} is VALID [2022-04-27 20:05:01,145 INFO L272 TraceCheckUtils]: 6: Hoare triple {347#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {347#true} is VALID [2022-04-27 20:05:01,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} [74] 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] {347#true} is VALID [2022-04-27 20:05:01,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#true} [77] 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[] {347#true} is VALID [2022-04-27 20:05:01,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:01,145 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {347#true} {347#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {347#true} is VALID [2022-04-27 20:05:01,146 INFO L272 TraceCheckUtils]: 11: Hoare triple {347#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-27 20:05:01,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#true} [74] 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] {347#true} is VALID [2022-04-27 20:05:01,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#true} [77] 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[] {347#true} is VALID [2022-04-27 20:05:01,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:01,147 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#true} {347#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-27 20:05:01,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {347#true} [75] L22-->L28-2: 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] {400#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:05:01,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {400#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:05:01,148 INFO L272 TraceCheckUtils]: 18: Hoare triple {400#(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] {347#true} is VALID [2022-04-27 20:05:01,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {347#true} [85] __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] {347#true} is VALID [2022-04-27 20:05:01,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {347#true} [90] 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[] {347#true} is VALID [2022-04-27 20:05:01,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {347#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:01,150 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {347#true} {400#(and (= main_~x~0 0) (= main_~y~0 0))} [99] __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] {400#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:05:01,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {400#(and (= main_~x~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {422#(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-27 20:05:01,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {422#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#(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-27 20:05:01,152 INFO L272 TraceCheckUtils]: 25: Hoare triple {422#(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] {429#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:05:01,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {429#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {433#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:05:01,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {433#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {348#false} is VALID [2022-04-27 20:05:01,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {348#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-27 20:05:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 20:05:01,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:05:58,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {348#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-27 20:05:58,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {433#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {348#false} is VALID [2022-04-27 20:05:58,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {429#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {433#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:05:58,017 INFO L272 TraceCheckUtils]: 25: Hoare triple {449#(= (+ 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] {429#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:05:58,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {449#(= (+ 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)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {449#(= (+ 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-27 20:05:58,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {449#(= (+ 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)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {449#(= (+ 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-27 20:05:58,985 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {347#true} {449#(= (+ 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)))} [99] __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] {449#(= (+ 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-27 20:05:58,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {347#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:58,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {347#true} [90] 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[] {347#true} is VALID [2022-04-27 20:05:58,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {347#true} [85] __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] {347#true} is VALID [2022-04-27 20:05:58,986 INFO L272 TraceCheckUtils]: 18: Hoare triple {449#(= (+ 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] {347#true} is VALID [2022-04-27 20:05:58,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {449#(= (+ 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)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {449#(= (+ 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-27 20:05:58,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {347#true} [75] L22-->L28-2: 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] {449#(= (+ 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-27 20:05:58,988 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#true} {347#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-27 20:05:58,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:58,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#true} [77] 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[] {347#true} is VALID [2022-04-27 20:05:58,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#true} [74] 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] {347#true} is VALID [2022-04-27 20:05:58,988 INFO L272 TraceCheckUtils]: 11: Hoare triple {347#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {347#true} is VALID [2022-04-27 20:05:58,989 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {347#true} {347#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {347#true} is VALID [2022-04-27 20:05:58,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:58,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#true} [77] 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[] {347#true} is VALID [2022-04-27 20:05:58,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} [74] 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] {347#true} is VALID [2022-04-27 20:05:58,989 INFO L272 TraceCheckUtils]: 6: Hoare triple {347#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {347#true} is VALID [2022-04-27 20:05:58,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} [70] mainENTRY-->L21: 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] {347#true} is VALID [2022-04-27 20:05:58,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:58,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:58,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:58,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {347#true} is VALID [2022-04-27 20:05:58,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-27 20:05:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 20:05:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:05:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394043819] [2022-04-27 20:05:58,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:05:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140865873] [2022-04-27 20:05:58,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140865873] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 20:05:58,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:05:58,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 20:05:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997734104] [2022-04-27 20:05:58,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:05:58,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 20:05:58,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:05:58,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:05:59,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:05:59,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 20:05:59,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:05:59,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 20:05:59,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-04-27 20:05:59,388 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:05:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:05:59,500 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-27 20:05:59,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 20:05:59,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 20:05:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:05:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:05:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 20:05:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:05:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 20:05:59,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-27 20:05:59,956 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-27 20:05:59,957 INFO L225 Difference]: With dead ends: 35 [2022-04-27 20:05:59,957 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 20:05:59,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-04-27 20:05:59,958 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 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-27 20:05:59,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:05:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 20:05:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 20:05:59,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:05:59,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:05:59,961 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:05:59,962 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:05:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:05:59,963 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 20:05:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 20:05:59,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:05:59,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:05:59,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 20:05:59,964 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 20:05:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:05:59,966 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 20:05:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 20:05:59,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:05:59,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:05:59,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:05:59,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:05:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:05:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-27 20:05:59,968 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-27 20:05:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:05:59,968 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-27 20:05:59,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 20:05:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-27 20:05:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 20:05:59,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:05:59,970 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:05:59,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 20:06:00,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 20:06:00,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:06:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:06:00,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1285656823, now seen corresponding path program 1 times [2022-04-27 20:06:00,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:06:00,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129565630] [2022-04-27 20:06:00,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:00,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:06:00,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:06:00,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265645172] [2022-04-27 20:06:00,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:00,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:06:00,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:06:00,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:06:00,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 20:06:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:00,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 20:06:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:00,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:06:00,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {663#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-27 20:06:00,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {663#true} is VALID [2022-04-27 20:06:00,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-27 20:06:00,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {663#true} {663#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-27 20:06:00,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {663#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-27 20:06:00,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#true} [70] mainENTRY-->L21: 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] {663#true} is VALID [2022-04-27 20:06:00,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {663#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {663#true} is VALID [2022-04-27 20:06:00,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {663#true} [74] 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] {663#true} is VALID [2022-04-27 20:06:00,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {663#true} [77] 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[] {663#true} is VALID [2022-04-27 20:06:00,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {663#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-27 20:06:00,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {663#true} {663#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {663#true} is VALID [2022-04-27 20:06:00,564 INFO L272 TraceCheckUtils]: 11: Hoare triple {663#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {663#true} is VALID [2022-04-27 20:06:00,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {663#true} [74] 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] {663#true} is VALID [2022-04-27 20:06:00,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {663#true} [77] 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[] {663#true} is VALID [2022-04-27 20:06:00,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {663#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-27 20:06:00,564 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {663#true} {663#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {663#true} is VALID [2022-04-27 20:06:00,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {663#true} [75] L22-->L28-2: 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] {716#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:00,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {716#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:00,566 INFO L272 TraceCheckUtils]: 18: Hoare triple {716#(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] {663#true} is VALID [2022-04-27 20:06:00,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {663#true} [85] __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] {663#true} is VALID [2022-04-27 20:06:00,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {663#true} [90] 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[] {663#true} is VALID [2022-04-27 20:06:00,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {663#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-27 20:06:00,567 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {663#true} {716#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __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] {716#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:00,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {716#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:06:00,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:06:00,568 INFO L272 TraceCheckUtils]: 25: Hoare triple {738#(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] {663#true} is VALID [2022-04-27 20:06:00,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {663#true} [85] __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] {663#true} is VALID [2022-04-27 20:06:00,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {663#true} [90] 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[] {663#true} is VALID [2022-04-27 20:06:00,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {663#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-27 20:06:00,570 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {663#true} {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [99] __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] {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:06:00,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {738#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {760#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 20:06:00,570 INFO L272 TraceCheckUtils]: 31: Hoare triple {760#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [82] L28-3-->__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] {663#true} is VALID [2022-04-27 20:06:00,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {663#true} [85] __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] {663#true} is VALID [2022-04-27 20:06:00,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {663#true} [90] 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[] {663#true} is VALID [2022-04-27 20:06:00,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {663#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {663#true} is VALID [2022-04-27 20:06:00,572 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {663#true} {760#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [100] __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] {760#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 20:06:00,573 INFO L272 TraceCheckUtils]: 36: Hoare triple {760#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:06:00,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:06:00,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {664#false} is VALID [2022-04-27 20:06:00,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {664#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#false} is VALID [2022-04-27 20:06:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 20:06:00,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:06:00,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:06:00,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129565630] [2022-04-27 20:06:00,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:06:00,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265645172] [2022-04-27 20:06:00,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265645172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:06:00,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:06:00,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 20:06:00,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520447920] [2022-04-27 20:06:00,860 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:06:00,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 20:06:00,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:06:00,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 20:06:00,890 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-27 20:06:00,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 20:06:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:06:00,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 20:06:00,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 20:06:00,891 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 20:06:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:01,101 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-27 20:06:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 20:06:01,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-27 20:06:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:06:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 20:06:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 20:06:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 20:06:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 20:06:01,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-27 20:06:01,136 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-27 20:06:01,137 INFO L225 Difference]: With dead ends: 40 [2022-04-27 20:06:01,137 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 20:06:01,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 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-27 20:06:01,138 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:06:01,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:06:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 20:06:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 20:06:01,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:06:01,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:06:01,141 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:06:01,141 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:06:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:01,143 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 20:06:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 20:06:01,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:01,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:01,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 20:06:01,144 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 20:06:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:01,145 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 20:06:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 20:06:01,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:01,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:01,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:06:01,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:06:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:06:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-27 20:06:01,147 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-27 20:06:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:06:01,147 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-27 20:06:01,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 20:06:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-27 20:06:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 20:06:01,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:06:01,149 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:06:01,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 20:06:01,363 WARN L477 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-27 20:06:01,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:06:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:06:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash -542323485, now seen corresponding path program 2 times [2022-04-27 20:06:01,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:06:01,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306032421] [2022-04-27 20:06:01,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:01,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:06:01,394 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:06:01,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349674053] [2022-04-27 20:06:01,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 20:06:01,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:06:01,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:06:01,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:06:01,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 20:06:01,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 20:06:01,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:06:01,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 20:06:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:01,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:06:01,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {998#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {998#true} is VALID [2022-04-27 20:06:01,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {998#true} {998#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {998#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {998#true} [70] mainENTRY-->L21: 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] {998#true} is VALID [2022-04-27 20:06:01,841 INFO L272 TraceCheckUtils]: 6: Hoare triple {998#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {998#true} is VALID [2022-04-27 20:06:01,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {998#true} [74] 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] {998#true} is VALID [2022-04-27 20:06:01,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {998#true} [77] 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[] {998#true} is VALID [2022-04-27 20:06:01,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {998#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {998#true} {998#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {998#true} is VALID [2022-04-27 20:06:01,842 INFO L272 TraceCheckUtils]: 11: Hoare triple {998#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {998#true} is VALID [2022-04-27 20:06:01,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {998#true} [74] 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] {998#true} is VALID [2022-04-27 20:06:01,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {998#true} [77] 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[] {998#true} is VALID [2022-04-27 20:06:01,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {998#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,843 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {998#true} {998#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {998#true} is VALID [2022-04-27 20:06:01,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {998#true} [75] L22-->L28-2: 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] {1051#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:01,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {1051#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1051#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:01,844 INFO L272 TraceCheckUtils]: 18: Hoare triple {1051#(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] {998#true} is VALID [2022-04-27 20:06:01,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {998#true} [85] __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] {998#true} is VALID [2022-04-27 20:06:01,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {998#true} [90] 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[] {998#true} is VALID [2022-04-27 20:06:01,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {998#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,845 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {998#true} {1051#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __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] {1051#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:01,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {1051#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1073#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 20:06:01,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {1073#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1073#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 20:06:01,846 INFO L272 TraceCheckUtils]: 25: Hoare triple {1073#(and (= main_~y~0 1) (< 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] {998#true} is VALID [2022-04-27 20:06:01,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {998#true} [85] __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] {998#true} is VALID [2022-04-27 20:06:01,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {998#true} [90] 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[] {998#true} is VALID [2022-04-27 20:06:01,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {998#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,848 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {998#true} {1073#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} [99] __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] {1073#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 20:06:01,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {1073#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1095#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 20:06:01,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {1095#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1095#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 20:06:01,849 INFO L272 TraceCheckUtils]: 32: Hoare triple {1095#(and (= main_~y~0 2) (< 1 main_~k~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] {998#true} is VALID [2022-04-27 20:06:01,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {998#true} [85] __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] {998#true} is VALID [2022-04-27 20:06:01,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {998#true} [90] 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[] {998#true} is VALID [2022-04-27 20:06:01,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {998#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,850 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {998#true} {1095#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} [99] __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] {1095#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-27 20:06:01,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {1095#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1117#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 20:06:01,851 INFO L272 TraceCheckUtils]: 38: Hoare triple {1117#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} [82] L28-3-->__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] {998#true} is VALID [2022-04-27 20:06:01,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {998#true} [85] __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] {998#true} is VALID [2022-04-27 20:06:01,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {998#true} [90] 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[] {998#true} is VALID [2022-04-27 20:06:01,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {998#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#true} is VALID [2022-04-27 20:06:01,852 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {998#true} {1117#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} [100] __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] {1117#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-27 20:06:01,852 INFO L272 TraceCheckUtils]: 43: Hoare triple {1117#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1136#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:06:01,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {1136#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {1140#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:06:01,856 INFO L290 TraceCheckUtils]: 45: Hoare triple {1140#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {999#false} is VALID [2022-04-27 20:06:01,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {999#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {999#false} is VALID [2022-04-27 20:06:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 20:06:01,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:06:02,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:06:02,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306032421] [2022-04-27 20:06:02,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:06:02,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349674053] [2022-04-27 20:06:02,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349674053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:06:02,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:06:02,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 20:06:02,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819088945] [2022-04-27 20:06:02,175 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:06:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 20:06:02,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:06:02,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 20:06:02,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:06:02,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 20:06:02,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:06:02,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 20:06:02,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-27 20:06:02,213 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 20:06:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:02,465 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 20:06:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 20:06:02,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-27 20:06:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:06:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 20:06:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-27 20:06:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 20:06:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-27 20:06:02,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-27 20:06:02,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:06:02,500 INFO L225 Difference]: With dead ends: 43 [2022-04-27 20:06:02,500 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 20:06:02,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 20:06:02,501 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:06:02,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:06:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 20:06:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 20:06:02,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:06:02,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:06:02,505 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:06:02,505 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:06:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:02,506 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 20:06:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 20:06:02,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:02,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:02,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 20:06:02,509 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-27 20:06:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:02,510 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 20:06:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 20:06:02,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:02,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:02,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:06:02,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:06:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:06:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-27 20:06:02,515 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-27 20:06:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:06:02,515 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-27 20:06:02,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 20:06:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-27 20:06:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 20:06:02,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:06:02,516 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:06:02,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 20:06:02,723 WARN L477 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-27 20:06:02,723 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:06:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:06:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2094100617, now seen corresponding path program 3 times [2022-04-27 20:06:02,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:06:02,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624938319] [2022-04-27 20:06:02,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:02,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:06:02,737 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:06:02,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188964007] [2022-04-27 20:06:02,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 20:06:02,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:06:02,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:06:02,739 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-27 20:06:02,740 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-27 20:06:02,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 20:06:02,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:06:02,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 20:06:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:02,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:06:03,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {1389#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1389#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1389#true} is VALID [2022-04-27 20:06:03,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {1389#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1389#true} {1389#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {1389#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1389#true} [70] mainENTRY-->L21: 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] {1389#true} is VALID [2022-04-27 20:06:03,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {1389#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {1389#true} is VALID [2022-04-27 20:06:03,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1389#true} [74] 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] {1389#true} is VALID [2022-04-27 20:06:03,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1389#true} [77] 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[] {1389#true} is VALID [2022-04-27 20:06:03,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1389#true} {1389#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {1389#true} is VALID [2022-04-27 20:06:03,313 INFO L272 TraceCheckUtils]: 11: Hoare triple {1389#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1389#true} is VALID [2022-04-27 20:06:03,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {1389#true} [74] 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] {1389#true} is VALID [2022-04-27 20:06:03,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {1389#true} [77] 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[] {1389#true} is VALID [2022-04-27 20:06:03,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {1389#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,313 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1389#true} {1389#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1389#true} is VALID [2022-04-27 20:06:03,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {1389#true} [75] L22-->L28-2: 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] {1442#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:03,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {1442#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1442#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:03,315 INFO L272 TraceCheckUtils]: 18: Hoare triple {1442#(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] {1389#true} is VALID [2022-04-27 20:06:03,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {1389#true} [85] __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] {1389#true} is VALID [2022-04-27 20:06:03,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {1389#true} [90] 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[] {1389#true} is VALID [2022-04-27 20:06:03,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {1389#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,316 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1389#true} {1442#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __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] {1442#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:03,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {1442#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1464#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 20:06:03,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {1464#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1464#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 20:06:03,318 INFO L272 TraceCheckUtils]: 25: Hoare triple {1464#(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] {1389#true} is VALID [2022-04-27 20:06:03,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {1389#true} [85] __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] {1389#true} is VALID [2022-04-27 20:06:03,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {1389#true} [90] 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[] {1389#true} is VALID [2022-04-27 20:06:03,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {1389#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,318 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1389#true} {1464#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [99] __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] {1464#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 20:06:03,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {1464#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1486#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 20:06:03,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {1486#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1486#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 20:06:03,319 INFO L272 TraceCheckUtils]: 32: Hoare triple {1486#(and (= (+ (- 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] {1389#true} is VALID [2022-04-27 20:06:03,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {1389#true} [85] __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] {1389#true} is VALID [2022-04-27 20:06:03,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {1389#true} [90] 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[] {1389#true} is VALID [2022-04-27 20:06:03,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {1389#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,320 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1389#true} {1486#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [99] __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] {1486#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 20:06:03,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {1486#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1508#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:06:03,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {1508#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1508#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:06:03,321 INFO L272 TraceCheckUtils]: 39: Hoare triple {1508#(and (<= main_~c~0 3) (= main_~y~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] {1389#true} is VALID [2022-04-27 20:06:03,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {1389#true} [85] __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] {1389#true} is VALID [2022-04-27 20:06:03,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {1389#true} [90] 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[] {1389#true} is VALID [2022-04-27 20:06:03,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {1389#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,326 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1389#true} {1508#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [99] __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] {1508#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:06:03,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {1508#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1530#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:06:03,327 INFO L272 TraceCheckUtils]: 45: Hoare triple {1530#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} [82] L28-3-->__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] {1389#true} is VALID [2022-04-27 20:06:03,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {1389#true} [85] __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] {1389#true} is VALID [2022-04-27 20:06:03,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {1389#true} [90] 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[] {1389#true} is VALID [2022-04-27 20:06:03,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {1389#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#true} is VALID [2022-04-27 20:06:03,328 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1389#true} {1530#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} [100] __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] {1530#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:06:03,328 INFO L272 TraceCheckUtils]: 50: Hoare triple {1530#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:06:03,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {1549#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {1553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:06:03,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {1553#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {1390#false} is VALID [2022-04-27 20:06:03,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {1390#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1390#false} is VALID [2022-04-27 20:06:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-27 20:06:03,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:06:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:06:03,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624938319] [2022-04-27 20:06:03,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:06:03,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188964007] [2022-04-27 20:06:03,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188964007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:06:03,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:06:03,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 20:06:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789252757] [2022-04-27 20:06:03,609 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:06:03,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 20:06:03,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:06:03,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 20:06:03,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:06:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 20:06:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:06:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 20:06:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 20:06:03,639 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 20:06:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:03,971 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-04-27 20:06:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 20:06:03,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-27 20:06:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:06:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 20:06:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-27 20:06:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 20:06:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-27 20:06:03,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-27 20:06:04,011 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-27 20:06:04,011 INFO L225 Difference]: With dead ends: 46 [2022-04-27 20:06:04,011 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 20:06:04,012 INFO L412 NwaCegarLoop]: 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-27 20:06:04,012 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:06:04,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:06:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 20:06:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-27 20:06:04,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:06:04,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:06:04,015 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:06:04,015 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:06:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:04,017 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 20:06:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 20:06:04,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:04,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:04,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 20:06:04,018 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-27 20:06:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:04,022 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 20:06:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 20:06:04,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:04,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:04,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:06:04,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:06:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:06:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 20:06:04,026 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-27 20:06:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:06:04,026 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 20:06:04,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 20:06:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 20:06:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 20:06:04,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:06:04,029 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:06:04,042 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-27 20:06:04,235 WARN L477 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-27 20:06:04,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:06:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:06:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash -826507677, now seen corresponding path program 4 times [2022-04-27 20:06:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:06:04,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003766597] [2022-04-27 20:06:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:06:04,245 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:06:04,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001797816] [2022-04-27 20:06:04,246 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 20:06:04,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:06:04,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:06:04,247 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-27 20:06:04,278 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-27 20:06:04,294 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 20:06:04,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:06:04,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 20:06:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:04,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:06:04,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1792#true} is VALID [2022-04-27 20:06:04,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#true} [70] mainENTRY-->L21: 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] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {1792#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} [74] 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] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} [77] 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[] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1792#true} {1792#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L272 TraceCheckUtils]: 11: Hoare triple {1792#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#true} [74] 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] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {1792#true} [77] 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[] {1792#true} is VALID [2022-04-27 20:06:04,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,658 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1792#true} {1792#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1792#true} is VALID [2022-04-27 20:06:04,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {1792#true} [75] L22-->L28-2: 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] {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:04,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:04,658 INFO L272 TraceCheckUtils]: 18: Hoare triple {1845#(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] {1792#true} is VALID [2022-04-27 20:06:04,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} [85] __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] {1792#true} is VALID [2022-04-27 20:06:04,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {1792#true} [90] 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[] {1792#true} is VALID [2022-04-27 20:06:04,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,659 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1792#true} {1845#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __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] {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:04,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1867#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:06:04,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {1867#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1867#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:06:04,660 INFO L272 TraceCheckUtils]: 25: Hoare triple {1867#(and (= (+ (- 1) main_~c~0) 0) (= 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] {1792#true} is VALID [2022-04-27 20:06:04,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} [85] __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] {1792#true} is VALID [2022-04-27 20:06:04,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {1792#true} [90] 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[] {1792#true} is VALID [2022-04-27 20:06:04,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {1792#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,661 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1792#true} {1867#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [99] __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] {1867#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:06:04,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {1867#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1889#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 20:06:04,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {1889#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1889#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 20:06:04,662 INFO L272 TraceCheckUtils]: 32: Hoare triple {1889#(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] {1792#true} is VALID [2022-04-27 20:06:04,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {1792#true} [85] __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] {1792#true} is VALID [2022-04-27 20:06:04,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {1792#true} [90] 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[] {1792#true} is VALID [2022-04-27 20:06:04,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {1792#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,663 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1792#true} {1889#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [99] __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] {1889#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 20:06:04,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1911#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:06:04,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {1911#(and (= main_~y~0 3) (= main_~c~0 3))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1911#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:06:04,664 INFO L272 TraceCheckUtils]: 39: Hoare triple {1911#(and (= main_~y~0 3) (= 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] {1792#true} is VALID [2022-04-27 20:06:04,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {1792#true} [85] __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] {1792#true} is VALID [2022-04-27 20:06:04,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {1792#true} [90] 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[] {1792#true} is VALID [2022-04-27 20:06:04,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {1792#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,665 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1792#true} {1911#(and (= main_~y~0 3) (= main_~c~0 3))} [99] __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] {1911#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:06:04,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {1911#(and (= main_~y~0 3) (= main_~c~0 3))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1933#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:06:04,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {1933#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1933#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:06:04,666 INFO L272 TraceCheckUtils]: 46: Hoare triple {1933#(and (= 3 (+ (- 1) main_~y~0)) (< 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] {1792#true} is VALID [2022-04-27 20:06:04,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {1792#true} [85] __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] {1792#true} is VALID [2022-04-27 20:06:04,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {1792#true} [90] 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[] {1792#true} is VALID [2022-04-27 20:06:04,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {1792#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,667 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1792#true} {1933#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} [99] __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] {1933#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:06:04,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {1933#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1955#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 20:06:04,667 INFO L272 TraceCheckUtils]: 52: Hoare triple {1955#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} [82] L28-3-->__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] {1792#true} is VALID [2022-04-27 20:06:04,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {1792#true} [85] __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] {1792#true} is VALID [2022-04-27 20:06:04,668 INFO L290 TraceCheckUtils]: 54: Hoare triple {1792#true} [90] 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[] {1792#true} is VALID [2022-04-27 20:06:04,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {1792#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1792#true} is VALID [2022-04-27 20:06:04,668 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {1792#true} {1955#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} [100] __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] {1955#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 20:06:04,669 INFO L272 TraceCheckUtils]: 57: Hoare triple {1955#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1974#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:06:04,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {1974#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:06:04,670 INFO L290 TraceCheckUtils]: 59: Hoare triple {1978#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {1793#false} is VALID [2022-04-27 20:06:04,670 INFO L290 TraceCheckUtils]: 60: Hoare triple {1793#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1793#false} is VALID [2022-04-27 20:06:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 20:06:04,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:06:04,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:06:04,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003766597] [2022-04-27 20:06:04,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:06:04,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001797816] [2022-04-27 20:06:04,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001797816] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:06:04,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:06:04,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 20:06:04,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378442668] [2022-04-27 20:06:04,936 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:06:04,936 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 20:06:04,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:06:04,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 20:06:04,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:06:04,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 20:06:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:06:04,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 20:06:04,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 20:06:04,969 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 20:06:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:05,363 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 20:06:05,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 20:06:05,363 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-27 20:06:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:06:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 20:06:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-27 20:06:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 20:06:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-27 20:06:05,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2022-04-27 20:06:05,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:06:05,408 INFO L225 Difference]: With dead ends: 49 [2022-04-27 20:06:05,408 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 20:06:05,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 20:06:05,409 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:06:05,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:06:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 20:06:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 20:06:05,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:06:05,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:06:05,411 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:06:05,412 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:06:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:05,413 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 20:06:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 20:06:05,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:05,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:05,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 20:06:05,414 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 20:06:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:05,415 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 20:06:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 20:06:05,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:05,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:05,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:06:05,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:06:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 20:06:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 20:06:05,417 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-27 20:06:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:06:05,417 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 20:06:05,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-27 20:06:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 20:06:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 20:06:05,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:06:05,418 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:06:05,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 20:06:05,633 WARN L477 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-27 20:06:05,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:06:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:06:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -170119689, now seen corresponding path program 5 times [2022-04-27 20:06:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:06:05,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045066356] [2022-04-27 20:06:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:06:05,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:06:05,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2086227837] [2022-04-27 20:06:05,644 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 20:06:05,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:06:05,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:06:05,645 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-27 20:06:05,646 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-27 20:06:20,772 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 20:06:20,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:06:20,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 20:06:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:20,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:06:21,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2229#true} is VALID [2022-04-27 20:06:21,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#true} [70] mainENTRY-->L21: 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] {2229#true} is VALID [2022-04-27 20:06:21,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {2229#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {2229#true} is VALID [2022-04-27 20:06:21,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#true} [74] 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] {2229#true} is VALID [2022-04-27 20:06:21,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {2229#true} [77] 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[] {2229#true} is VALID [2022-04-27 20:06:21,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {2229#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2229#true} {2229#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {2229#true} is VALID [2022-04-27 20:06:21,173 INFO L272 TraceCheckUtils]: 11: Hoare triple {2229#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2229#true} is VALID [2022-04-27 20:06:21,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {2229#true} [74] 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] {2229#true} is VALID [2022-04-27 20:06:21,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {2229#true} [77] 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[] {2229#true} is VALID [2022-04-27 20:06:21,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {2229#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,174 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2229#true} {2229#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2229#true} is VALID [2022-04-27 20:06:21,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#true} [75] L22-->L28-2: 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] {2282#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:21,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {2282#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2282#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:21,205 INFO L272 TraceCheckUtils]: 18: Hoare triple {2282#(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] {2229#true} is VALID [2022-04-27 20:06:21,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {2229#true} [85] __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] {2229#true} is VALID [2022-04-27 20:06:21,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {2229#true} [90] 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[] {2229#true} is VALID [2022-04-27 20:06:21,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {2229#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,210 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2229#true} {2282#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __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] {2282#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:21,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {2282#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2304#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 20:06:21,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {2304#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2304#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 20:06:21,211 INFO L272 TraceCheckUtils]: 25: Hoare triple {2304#(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] {2229#true} is VALID [2022-04-27 20:06:21,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {2229#true} [85] __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] {2229#true} is VALID [2022-04-27 20:06:21,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {2229#true} [90] 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[] {2229#true} is VALID [2022-04-27 20:06:21,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {2229#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,211 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2229#true} {2304#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [99] __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] {2304#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 20:06:21,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {2304#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2326#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 20:06:21,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {2326#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2326#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 20:06:21,212 INFO L272 TraceCheckUtils]: 32: Hoare triple {2326#(and (= main_~y~0 2) (= (+ (- 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] {2229#true} is VALID [2022-04-27 20:06:21,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {2229#true} [85] __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] {2229#true} is VALID [2022-04-27 20:06:21,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {2229#true} [90] 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[] {2229#true} is VALID [2022-04-27 20:06:21,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {2229#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,213 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2229#true} {2326#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [99] __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] {2326#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 20:06:21,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {2326#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2348#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 20:06:21,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {2348#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2348#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 20:06:21,214 INFO L272 TraceCheckUtils]: 39: Hoare triple {2348#(and (= 2 (+ (- 1) main_~y~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] {2229#true} is VALID [2022-04-27 20:06:21,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {2229#true} [85] __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] {2229#true} is VALID [2022-04-27 20:06:21,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {2229#true} [90] 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[] {2229#true} is VALID [2022-04-27 20:06:21,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {2229#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,214 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2229#true} {2348#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [99] __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] {2348#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-27 20:06:21,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {2348#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2370#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 20:06:21,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {2370#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2370#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 20:06:21,215 INFO L272 TraceCheckUtils]: 46: Hoare triple {2370#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~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] {2229#true} is VALID [2022-04-27 20:06:21,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {2229#true} [85] __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] {2229#true} is VALID [2022-04-27 20:06:21,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {2229#true} [90] 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[] {2229#true} is VALID [2022-04-27 20:06:21,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {2229#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,216 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2229#true} {2370#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} [99] __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] {2370#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-27 20:06:21,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {2370#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2392#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 20:06:21,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {2392#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2392#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 20:06:21,217 INFO L272 TraceCheckUtils]: 53: Hoare triple {2392#(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] {2229#true} is VALID [2022-04-27 20:06:21,217 INFO L290 TraceCheckUtils]: 54: Hoare triple {2229#true} [85] __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] {2229#true} is VALID [2022-04-27 20:06:21,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {2229#true} [90] 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[] {2229#true} is VALID [2022-04-27 20:06:21,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {2229#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,218 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2229#true} {2392#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [99] __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] {2392#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 20:06:21,219 INFO L290 TraceCheckUtils]: 58: Hoare triple {2392#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {2414#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 20:06:21,222 INFO L272 TraceCheckUtils]: 59: Hoare triple {2414#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [82] L28-3-->__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] {2229#true} is VALID [2022-04-27 20:06:21,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {2229#true} [85] __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] {2229#true} is VALID [2022-04-27 20:06:21,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {2229#true} [90] 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[] {2229#true} is VALID [2022-04-27 20:06:21,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {2229#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2229#true} is VALID [2022-04-27 20:06:21,223 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2229#true} {2414#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [100] __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] {2414#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 20:06:21,224 INFO L272 TraceCheckUtils]: 64: Hoare triple {2414#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:06:21,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {2433#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {2437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:06:21,226 INFO L290 TraceCheckUtils]: 66: Hoare triple {2437#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {2230#false} is VALID [2022-04-27 20:06:21,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {2230#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2230#false} is VALID [2022-04-27 20:06:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 20:06:21,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:06:21,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:06:21,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045066356] [2022-04-27 20:06:21,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:06:21,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086227837] [2022-04-27 20:06:21,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086227837] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:06:21,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:06:21,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 20:06:21,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981111556] [2022-04-27 20:06:21,444 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:06:21,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 20:06:21,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:06:21,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 20:06:21,479 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-27 20:06:21,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 20:06:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:06:21,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 20:06:21,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 20:06:21,480 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 20:06:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:21,962 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-27 20:06:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 20:06:21,962 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-27 20:06:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:06:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 20:06:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2022-04-27 20:06:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 20:06:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2022-04-27 20:06:21,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 57 transitions. [2022-04-27 20:06:22,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:06:22,009 INFO L225 Difference]: With dead ends: 52 [2022-04-27 20:06:22,009 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 20:06:22,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 20:06:22,010 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 20:06:22,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 20:06:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 20:06:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 20:06:22,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:06:22,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:06:22,013 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:06:22,013 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:06:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:22,014 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 20:06:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 20:06:22,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:22,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:22,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 20:06:22,016 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-27 20:06:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:22,021 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 20:06:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 20:06:22,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:22,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:22,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:06:22,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:06:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 20:06:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 20:06:22,024 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-27 20:06:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:06:22,024 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 20:06:22,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-27 20:06:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 20:06:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 20:06:22,024 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:06:22,025 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:06:22,037 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-27 20:06:22,235 WARN L477 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-27 20:06:22,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:06:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:06:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1505202147, now seen corresponding path program 6 times [2022-04-27 20:06:22,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:06:22,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717059764] [2022-04-27 20:06:22,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:22,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:06:22,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:06:22,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703253601] [2022-04-27 20:06:22,249 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 20:06:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:06:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:06:22,268 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-27 20:06:22,269 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-27 20:06:24,084 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 20:06:24,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:06:24,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 20:06:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:24,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:06:24,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {2700#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {2700#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2700#true} is VALID [2022-04-27 20:06:24,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {2700#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2700#true} {2700#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {2700#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {2700#true} [70] mainENTRY-->L21: 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] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {2700#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {2700#true} [74] 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] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {2700#true} [77] 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[] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {2700#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2700#true} {2700#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L272 TraceCheckUtils]: 11: Hoare triple {2700#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {2700#true} [74] 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] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {2700#true} [77] 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[] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {2700#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,650 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2700#true} {2700#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2700#true} is VALID [2022-04-27 20:06:24,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {2700#true} [75] L22-->L28-2: 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] {2753#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:24,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {2753#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2753#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:24,651 INFO L272 TraceCheckUtils]: 18: Hoare triple {2753#(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] {2700#true} is VALID [2022-04-27 20:06:24,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {2700#true} [85] __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] {2700#true} is VALID [2022-04-27 20:06:24,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {2700#true} [90] 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[] {2700#true} is VALID [2022-04-27 20:06:24,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {2700#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,652 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2700#true} {2753#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __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] {2753#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:24,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {2753#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2775#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:06:24,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {2775#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2775#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:06:24,653 INFO L272 TraceCheckUtils]: 25: Hoare triple {2775#(and (= (+ (- 1) main_~c~0) 0) (= 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] {2700#true} is VALID [2022-04-27 20:06:24,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {2700#true} [85] __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] {2700#true} is VALID [2022-04-27 20:06:24,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {2700#true} [90] 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[] {2700#true} is VALID [2022-04-27 20:06:24,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {2700#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,654 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2700#true} {2775#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [99] __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] {2775#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 20:06:24,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {2775#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2797#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 20:06:24,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {2797#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 20:06:24,655 INFO L272 TraceCheckUtils]: 32: Hoare triple {2797#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~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] {2700#true} is VALID [2022-04-27 20:06:24,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {2700#true} [85] __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] {2700#true} is VALID [2022-04-27 20:06:24,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {2700#true} [90] 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[] {2700#true} is VALID [2022-04-27 20:06:24,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {2700#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,656 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2700#true} {2797#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} [99] __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] {2797#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 20:06:24,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {2797#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2819#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 20:06:24,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {2819#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2819#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 20:06:24,657 INFO L272 TraceCheckUtils]: 39: Hoare triple {2819#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~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] {2700#true} is VALID [2022-04-27 20:06:24,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {2700#true} [85] __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] {2700#true} is VALID [2022-04-27 20:06:24,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {2700#true} [90] 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[] {2700#true} is VALID [2022-04-27 20:06:24,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {2700#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,658 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2700#true} {2819#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} [99] __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] {2819#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-27 20:06:24,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {2819#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2841#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 20:06:24,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {2841#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2841#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 20:06:24,659 INFO L272 TraceCheckUtils]: 46: Hoare triple {2841#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 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] {2700#true} is VALID [2022-04-27 20:06:24,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {2700#true} [85] __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] {2700#true} is VALID [2022-04-27 20:06:24,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {2700#true} [90] 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[] {2700#true} is VALID [2022-04-27 20:06:24,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {2700#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,660 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2700#true} {2841#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} [99] __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] {2841#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-27 20:06:24,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {2841#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2863#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 20:06:24,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {2863#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2863#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 20:06:24,661 INFO L272 TraceCheckUtils]: 53: Hoare triple {2863#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 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] {2700#true} is VALID [2022-04-27 20:06:24,661 INFO L290 TraceCheckUtils]: 54: Hoare triple {2700#true} [85] __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] {2700#true} is VALID [2022-04-27 20:06:24,661 INFO L290 TraceCheckUtils]: 55: Hoare triple {2700#true} [90] 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[] {2700#true} is VALID [2022-04-27 20:06:24,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {2700#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,661 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2700#true} {2863#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} [99] __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] {2863#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-27 20:06:24,662 INFO L290 TraceCheckUtils]: 58: Hoare triple {2863#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2885#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 20:06:24,662 INFO L290 TraceCheckUtils]: 59: Hoare triple {2885#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2885#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 20:06:24,662 INFO L272 TraceCheckUtils]: 60: Hoare triple {2885#(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] {2700#true} is VALID [2022-04-27 20:06:24,662 INFO L290 TraceCheckUtils]: 61: Hoare triple {2700#true} [85] __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] {2700#true} is VALID [2022-04-27 20:06:24,662 INFO L290 TraceCheckUtils]: 62: Hoare triple {2700#true} [90] 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[] {2700#true} is VALID [2022-04-27 20:06:24,663 INFO L290 TraceCheckUtils]: 63: Hoare triple {2700#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,663 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {2700#true} {2885#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [99] __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] {2885#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 20:06:24,664 INFO L290 TraceCheckUtils]: 65: Hoare triple {2885#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {2907#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 20:06:24,664 INFO L272 TraceCheckUtils]: 66: Hoare triple {2907#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [82] L28-3-->__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] {2700#true} is VALID [2022-04-27 20:06:24,664 INFO L290 TraceCheckUtils]: 67: Hoare triple {2700#true} [85] __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] {2700#true} is VALID [2022-04-27 20:06:24,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {2700#true} [90] 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[] {2700#true} is VALID [2022-04-27 20:06:24,664 INFO L290 TraceCheckUtils]: 69: Hoare triple {2700#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#true} is VALID [2022-04-27 20:06:24,664 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2700#true} {2907#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [100] __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] {2907#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 20:06:24,665 INFO L272 TraceCheckUtils]: 71: Hoare triple {2907#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2926#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:06:24,665 INFO L290 TraceCheckUtils]: 72: Hoare triple {2926#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {2930#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:06:24,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {2930#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {2701#false} is VALID [2022-04-27 20:06:24,666 INFO L290 TraceCheckUtils]: 74: Hoare triple {2701#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2701#false} is VALID [2022-04-27 20:06:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-27 20:06:24,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:06:25,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:06:25,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717059764] [2022-04-27 20:06:25,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:06:25,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703253601] [2022-04-27 20:06:25,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703253601] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:06:25,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:06:25,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 20:06:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370104437] [2022-04-27 20:06:25,289 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:06:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 20:06:25,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:06:25,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 20:06:25,328 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-27 20:06:25,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 20:06:25,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:06:25,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 20:06:25,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-27 20:06:25,329 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 20:06:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:25,970 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-27 20:06:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 20:06:25,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-27 20:06:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:06:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 20:06:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-04-27 20:06:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 20:06:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-04-27 20:06:25,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 61 transitions. [2022-04-27 20:06:26,017 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-27 20:06:26,018 INFO L225 Difference]: With dead ends: 55 [2022-04-27 20:06:26,018 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 20:06:26,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-27 20:06:26,018 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 20:06:26,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 302 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 20:06:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 20:06:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 20:06:26,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:06:26,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:06:26,021 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:06:26,021 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:06:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:26,023 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 20:06:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 20:06:26,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:26,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:26,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 20:06:26,023 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-27 20:06:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:26,025 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 20:06:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 20:06:26,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:26,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:26,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:06:26,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:06:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 20:06:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-27 20:06:26,026 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-27 20:06:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:06:26,026 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-27 20:06:26,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 20:06:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-27 20:06:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 20:06:26,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:06:26,027 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:06:26,039 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-27 20:06:26,239 WARN L477 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-27 20:06:26,239 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:06:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:06:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 252865655, now seen corresponding path program 7 times [2022-04-27 20:06:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:06:26,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646668989] [2022-04-27 20:06:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:06:26,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:06:26,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817678244] [2022-04-27 20:06:26,263 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 20:06:26,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:06:26,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:06:26,279 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-27 20:06:26,280 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-27 20:06:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:27,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 20:06:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:27,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:06:27,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {3293#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {3293#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3293#true} is VALID [2022-04-27 20:06:27,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {3293#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3293#true} {3293#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {3293#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {3293#true} [70] mainENTRY-->L21: 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] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L272 TraceCheckUtils]: 6: Hoare triple {3293#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {3293#true} [74] 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] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {3293#true} [77] 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[] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {3293#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3293#true} {3293#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {3293#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {3293#true} [74] 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] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {3293#true} [77] 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[] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {3293#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3293#true} {3293#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3293#true} is VALID [2022-04-27 20:06:27,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {3293#true} [75] L22-->L28-2: 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] {3346#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:27,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {3346#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:27,809 INFO L272 TraceCheckUtils]: 18: Hoare triple {3346#(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] {3293#true} is VALID [2022-04-27 20:06:27,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {3293#true} [85] __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] {3293#true} is VALID [2022-04-27 20:06:27,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {3293#true} [90] 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[] {3293#true} is VALID [2022-04-27 20:06:27,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {3293#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,810 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3293#true} {3346#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __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] {3346#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:27,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {3346#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3368#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:06:27,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {3368#(and (= main_~y~0 1) (= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3368#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:06:27,811 INFO L272 TraceCheckUtils]: 25: Hoare triple {3368#(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] {3293#true} is VALID [2022-04-27 20:06:27,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {3293#true} [85] __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] {3293#true} is VALID [2022-04-27 20:06:27,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {3293#true} [90] 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[] {3293#true} is VALID [2022-04-27 20:06:27,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {3293#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,811 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3293#true} {3368#(and (= main_~y~0 1) (= main_~c~0 1))} [99] __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] {3368#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:06:27,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {3368#(and (= main_~y~0 1) (= main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3390#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 20:06:27,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {3390#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3390#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 20:06:27,812 INFO L272 TraceCheckUtils]: 32: Hoare triple {3390#(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] {3293#true} is VALID [2022-04-27 20:06:27,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {3293#true} [85] __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] {3293#true} is VALID [2022-04-27 20:06:27,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {3293#true} [90] 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[] {3293#true} is VALID [2022-04-27 20:06:27,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {3293#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,813 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3293#true} {3390#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [99] __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] {3390#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 20:06:27,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {3390#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3412#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 20:06:27,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {3412#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3412#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 20:06:27,814 INFO L272 TraceCheckUtils]: 39: Hoare triple {3412#(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] {3293#true} is VALID [2022-04-27 20:06:27,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {3293#true} [85] __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] {3293#true} is VALID [2022-04-27 20:06:27,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {3293#true} [90] 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[] {3293#true} is VALID [2022-04-27 20:06:27,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {3293#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,814 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3293#true} {3412#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [99] __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] {3412#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 20:06:27,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {3412#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3434#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 20:06:27,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {3434#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3434#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 20:06:27,818 INFO L272 TraceCheckUtils]: 46: Hoare triple {3434#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) 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] {3293#true} is VALID [2022-04-27 20:06:27,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {3293#true} [85] __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] {3293#true} is VALID [2022-04-27 20:06:27,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {3293#true} [90] 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[] {3293#true} is VALID [2022-04-27 20:06:27,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {3293#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,820 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3293#true} {3434#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [99] __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] {3434#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 20:06:27,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {3434#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3456#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 20:06:27,821 INFO L290 TraceCheckUtils]: 52: Hoare triple {3456#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3456#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 20:06:27,821 INFO L272 TraceCheckUtils]: 53: Hoare triple {3456#(and (= 2 (+ main_~c~0 (- 3))) (= 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] {3293#true} is VALID [2022-04-27 20:06:27,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {3293#true} [85] __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] {3293#true} is VALID [2022-04-27 20:06:27,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {3293#true} [90] 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[] {3293#true} is VALID [2022-04-27 20:06:27,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {3293#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,821 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3293#true} {3456#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} [99] __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] {3456#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-27 20:06:27,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {3456#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3478#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 20:06:27,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {3478#(and (= main_~y~0 6) (= main_~c~0 6))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 20:06:27,822 INFO L272 TraceCheckUtils]: 60: Hoare triple {3478#(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] {3293#true} is VALID [2022-04-27 20:06:27,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {3293#true} [85] __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] {3293#true} is VALID [2022-04-27 20:06:27,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {3293#true} [90] 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[] {3293#true} is VALID [2022-04-27 20:06:27,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {3293#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,823 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3293#true} {3478#(and (= main_~y~0 6) (= main_~c~0 6))} [99] __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] {3478#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 20:06:27,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {3478#(and (= main_~y~0 6) (= main_~c~0 6))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3500#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 20:06:27,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {3500#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3500#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 20:06:27,824 INFO L272 TraceCheckUtils]: 67: Hoare triple {3500#(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] {3293#true} is VALID [2022-04-27 20:06:27,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {3293#true} [85] __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] {3293#true} is VALID [2022-04-27 20:06:27,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {3293#true} [90] 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[] {3293#true} is VALID [2022-04-27 20:06:27,824 INFO L290 TraceCheckUtils]: 70: Hoare triple {3293#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,824 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3293#true} {3500#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [99] __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] {3500#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 20:06:27,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {3500#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {3522#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 20:06:27,825 INFO L272 TraceCheckUtils]: 73: Hoare triple {3522#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [82] L28-3-->__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] {3293#true} is VALID [2022-04-27 20:06:27,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {3293#true} [85] __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] {3293#true} is VALID [2022-04-27 20:06:27,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {3293#true} [90] 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[] {3293#true} is VALID [2022-04-27 20:06:27,825 INFO L290 TraceCheckUtils]: 76: Hoare triple {3293#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3293#true} is VALID [2022-04-27 20:06:27,826 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3293#true} {3522#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [100] __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] {3522#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 20:06:27,827 INFO L272 TraceCheckUtils]: 78: Hoare triple {3522#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:06:27,827 INFO L290 TraceCheckUtils]: 79: Hoare triple {3541#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {3545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:06:27,828 INFO L290 TraceCheckUtils]: 80: Hoare triple {3545#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {3294#false} is VALID [2022-04-27 20:06:27,828 INFO L290 TraceCheckUtils]: 81: Hoare triple {3294#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3294#false} is VALID [2022-04-27 20:06:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-27 20:06:27,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:06:28,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:06:28,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646668989] [2022-04-27 20:06:28,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:06:28,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817678244] [2022-04-27 20:06:28,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817678244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:06:28,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:06:28,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 20:06:28,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901273256] [2022-04-27 20:06:28,093 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:06:28,093 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 20:06:28,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:06:28,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 20:06:28,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:06:28,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 20:06:28,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:06:28,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 20:06:28,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 20:06:28,131 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 20:06:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:28,850 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-04-27 20:06:28,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 20:06:28,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-27 20:06:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:06:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 20:06:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-27 20:06:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 20:06:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-27 20:06:28,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 65 transitions. [2022-04-27 20:06:28,900 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-27 20:06:28,901 INFO L225 Difference]: With dead ends: 58 [2022-04-27 20:06:28,901 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 20:06:28,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-27 20:06:28,902 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 20:06:28,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 20:06:28,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 20:06:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 20:06:28,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:06:28,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 20:06:28,904 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 20:06:28,905 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 20:06:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:28,906 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 20:06:28,906 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 20:06:28,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:28,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:28,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 20:06:28,906 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-27 20:06:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:28,907 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 20:06:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 20:06:28,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:28,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:28,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:06:28,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:06:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 20:06:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 20:06:28,909 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-27 20:06:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:06:28,909 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 20:06:28,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-27 20:06:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 20:06:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-27 20:06:28,910 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:06:28,910 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:06:28,919 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-27 20:06:29,115 WARN L477 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-27 20:06:29,115 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:06:29,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:06:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash 288751971, now seen corresponding path program 8 times [2022-04-27 20:06:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:06:29,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376166252] [2022-04-27 20:06:29,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:06:29,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:06:29,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254680092] [2022-04-27 20:06:29,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 20:06:29,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:06:29,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:06:29,135 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-27 20:06:29,139 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-27 20:06:37,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 20:06:37,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:06:37,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 20:06:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:06:37,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:06:37,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {3832#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {3832#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3832#true} is VALID [2022-04-27 20:06:37,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {3832#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3832#true} {3832#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {3832#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {3832#true} [70] mainENTRY-->L21: 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] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {3832#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {3832#true} [74] 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] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {3832#true} [77] 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[] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {3832#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3832#true} {3832#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L272 TraceCheckUtils]: 11: Hoare triple {3832#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {3832#true} [74] 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] {3832#true} is VALID [2022-04-27 20:06:37,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {3832#true} [77] 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[] {3832#true} is VALID [2022-04-27 20:06:37,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {3832#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,776 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3832#true} {3832#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3832#true} is VALID [2022-04-27 20:06:37,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {3832#true} [75] L22-->L28-2: 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] {3885#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:37,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {3885#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3885#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:37,776 INFO L272 TraceCheckUtils]: 18: Hoare triple {3885#(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] {3832#true} is VALID [2022-04-27 20:06:37,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,777 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3832#true} {3885#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __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] {3885#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:06:37,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {3885#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3907#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:06:37,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {3907#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3907#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:06:37,778 INFO L272 TraceCheckUtils]: 25: Hoare triple {3907#(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] {3832#true} is VALID [2022-04-27 20:06:37,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,779 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3832#true} {3907#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [99] __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] {3907#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:06:37,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {3907#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3929#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:06:37,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {3929#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3929#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:06:37,780 INFO L272 TraceCheckUtils]: 32: Hoare triple {3929#(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] {3832#true} is VALID [2022-04-27 20:06:37,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,785 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3832#true} {3929#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [99] __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] {3929#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:06:37,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {3929#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3951#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:06:37,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {3951#(and (= main_~y~0 3) (= main_~c~0 3))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3951#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:06:37,786 INFO L272 TraceCheckUtils]: 39: Hoare triple {3951#(and (= main_~y~0 3) (= 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] {3832#true} is VALID [2022-04-27 20:06:37,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,788 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3832#true} {3951#(and (= main_~y~0 3) (= main_~c~0 3))} [99] __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] {3951#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 20:06:37,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {3951#(and (= main_~y~0 3) (= main_~c~0 3))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3973#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 20:06:37,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {3973#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3973#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 20:06:37,789 INFO L272 TraceCheckUtils]: 46: Hoare triple {3973#(and (= (+ (- 1) main_~c~0) 3) (= 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] {3832#true} is VALID [2022-04-27 20:06:37,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,795 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3832#true} {3973#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [99] __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] {3973#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 20:06:37,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {3973#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3995#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 20:06:37,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {3995#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3995#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 20:06:37,796 INFO L272 TraceCheckUtils]: 53: Hoare triple {3995#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) 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] {3832#true} is VALID [2022-04-27 20:06:37,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,796 INFO L290 TraceCheckUtils]: 56: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,797 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3832#true} {3995#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} [99] __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] {3995#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 20:06:37,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {3995#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4017#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 20:06:37,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {4017#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4017#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 20:06:37,798 INFO L272 TraceCheckUtils]: 60: Hoare triple {4017#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 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] {3832#true} is VALID [2022-04-27 20:06:37,798 INFO L290 TraceCheckUtils]: 61: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,798 INFO L290 TraceCheckUtils]: 62: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,798 INFO L290 TraceCheckUtils]: 63: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,798 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3832#true} {4017#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} [99] __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] {4017#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 20:06:37,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {4017#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4039#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 20:06:37,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {4039#(and (= 7 main_~y~0) (= 7 main_~c~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4039#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 20:06:37,799 INFO L272 TraceCheckUtils]: 67: Hoare triple {4039#(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] {3832#true} is VALID [2022-04-27 20:06:37,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,800 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3832#true} {4039#(and (= 7 main_~y~0) (= 7 main_~c~0))} [99] __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] {4039#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 20:06:37,800 INFO L290 TraceCheckUtils]: 72: Hoare triple {4039#(and (= 7 main_~y~0) (= 7 main_~c~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (< v_main_~c~0_5 v_main_~k~0_8) (= (+ 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_8} 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_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4061#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 20:06:37,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {4061#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4061#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 20:06:37,801 INFO L272 TraceCheckUtils]: 74: Hoare triple {4061#(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] {3832#true} is VALID [2022-04-27 20:06:37,801 INFO L290 TraceCheckUtils]: 75: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,801 INFO L290 TraceCheckUtils]: 76: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,801 INFO L290 TraceCheckUtils]: 77: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,802 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {3832#true} {4061#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [99] __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] {4061#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 20:06:37,802 INFO L290 TraceCheckUtils]: 79: Hoare triple {4061#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {4083#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 20:06:37,802 INFO L272 TraceCheckUtils]: 80: Hoare triple {4083#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [82] L28-3-->__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] {3832#true} is VALID [2022-04-27 20:06:37,802 INFO L290 TraceCheckUtils]: 81: Hoare triple {3832#true} [85] __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] {3832#true} is VALID [2022-04-27 20:06:37,802 INFO L290 TraceCheckUtils]: 82: Hoare triple {3832#true} [90] 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[] {3832#true} is VALID [2022-04-27 20:06:37,802 INFO L290 TraceCheckUtils]: 83: Hoare triple {3832#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3832#true} is VALID [2022-04-27 20:06:37,803 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {3832#true} {4083#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [100] __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] {4083#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 20:06:37,803 INFO L272 TraceCheckUtils]: 85: Hoare triple {4083#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4102#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:06:37,804 INFO L290 TraceCheckUtils]: 86: Hoare triple {4102#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __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] {4106#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:06:37,804 INFO L290 TraceCheckUtils]: 87: Hoare triple {4106#(<= 1 __VERIFIER_assert_~cond)} [89] 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[] {3833#false} is VALID [2022-04-27 20:06:37,804 INFO L290 TraceCheckUtils]: 88: Hoare triple {3833#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3833#false} is VALID [2022-04-27 20:06:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-27 20:06:37,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:06:38,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:06:38,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376166252] [2022-04-27 20:06:38,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:06:38,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254680092] [2022-04-27 20:06:38,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254680092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:06:38,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:06:38,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 20:06:38,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174445053] [2022-04-27 20:06:38,094 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:06:38,095 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 20:06:38,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:06:38,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 20:06:38,133 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-27 20:06:38,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 20:06:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:06:38,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 20:06:38,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 20:06:38,133 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 20:06:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:39,001 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-04-27 20:06:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 20:06:39,002 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-27 20:06:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:06:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 20:06:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 20:06:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 20:06:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-27 20:06:39,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-27 20:06:39,067 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-27 20:06:39,068 INFO L225 Difference]: With dead ends: 61 [2022-04-27 20:06:39,068 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 20:06:39,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 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-27 20:06:39,068 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 20:06:39,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 20:06:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 20:06:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 20:06:39,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:06:39,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 20:06:39,072 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 20:06:39,072 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 20:06:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:39,074 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 20:06:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 20:06:39,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:39,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:39,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 20:06:39,074 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-27 20:06:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:06:39,076 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-27 20:06:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 20:06:39,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:06:39,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:06:39,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:06:39,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:06:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 20:06:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-27 20:06:39,096 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-27 20:06:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:06:39,096 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-27 20:06:39,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-27 20:06:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-27 20:06:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-27 20:06:39,097 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:06:39,098 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:06:39,107 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-27 20:06:39,306 WARN L477 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-27 20:06:39,307 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:06:39,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:06:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash -482784521, now seen corresponding path program 9 times [2022-04-27 20:06:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:06:39,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152163460] [2022-04-27 20:06:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:06:39,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:06:39,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:06:39,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301753853] [2022-04-27 20:06:39,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 20:06:39,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:06:39,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:06:39,325 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-27 20:06:39,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process