/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/ps5-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:48:19,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:48:19,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:48:19,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:48:19,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:48:19,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:48:19,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:48:19,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:48:19,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:48:19,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:48:19,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:48:19,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:48:19,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:48:19,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:48:19,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:48:19,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:48:19,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:48:19,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:48:19,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:48:19,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:48:19,436 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:48:19,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:48:19,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:48:19,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:48:19,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:48:19,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:48:19,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:48:19,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:48:19,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:48:19,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:48:19,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:48:19,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:48:19,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:48:19,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:48:19,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:48:19,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:48:19,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:48:19,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:48:19,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:48:19,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:48:19,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:48:19,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:48:19,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:48:19,459 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:48:19,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:48:19,461 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:48:19,461 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:48:19,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:48:19,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:48:19,461 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:48:19,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:48:19,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:48:19,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:48:19,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:48:19,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:48:19,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:48:19,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:48:19,463 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:48:19,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:48:19,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:48:19,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:48:19,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:48:19,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:48:19,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:48:19,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:48:19,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:48:19,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:48:19,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:48:19,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:48:19,464 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:48:19,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:48:19,465 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:48:19,465 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 22:48:19,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:48:19,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:48:19,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:48:19,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:48:19,621 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:48:19,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps5-ll.c [2022-04-27 22:48:19,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687a77d0b/44f4d9c2c4ce484eacc3d1f1c4f4e9a7/FLAGa81a04054 [2022-04-27 22:48:19,962 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:48:19,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps5-ll.c [2022-04-27 22:48:19,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687a77d0b/44f4d9c2c4ce484eacc3d1f1c4f4e9a7/FLAGa81a04054 [2022-04-27 22:48:20,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687a77d0b/44f4d9c2c4ce484eacc3d1f1c4f4e9a7 [2022-04-27 22:48:20,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:48:20,410 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:48:20,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:48:20,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:48:20,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:48:20,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9cf59b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20, skipping insertion in model container [2022-04-27 22:48:20,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:48:20,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:48:20,537 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/ps5-ll.c[458,471] [2022-04-27 22:48:20,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:48:20,556 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:48:20,563 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/ps5-ll.c[458,471] [2022-04-27 22:48:20,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:48:20,580 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:48:20,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20 WrapperNode [2022-04-27 22:48:20,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:48:20,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:48:20,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:48:20,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:48:20,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:48:20,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:48:20,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:48:20,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:48:20,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:48:20,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:48:20,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:48:20,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:48:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:48:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:48:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:48:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:48:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:48:20,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:48:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:48:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:48:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:48:20,691 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:48:20,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:48:20,807 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:48:20,812 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:48:20,812 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:48:20,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:48:20 BoogieIcfgContainer [2022-04-27 22:48:20,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:48:20,814 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:48:20,814 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:48:20,815 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:48:20,817 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:48:20" (1/1) ... [2022-04-27 22:48:20,818 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:48:20,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:48:20 BasicIcfg [2022-04-27 22:48:20,835 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:48:20,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:48:20,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:48:20,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:48:20,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:48:20" (1/4) ... [2022-04-27 22:48:20,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64917481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:48:20, skipping insertion in model container [2022-04-27 22:48:20,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:48:20" (2/4) ... [2022-04-27 22:48:20,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64917481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:48:20, skipping insertion in model container [2022-04-27 22:48:20,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:48:20" (3/4) ... [2022-04-27 22:48:20,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64917481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:48:20, skipping insertion in model container [2022-04-27 22:48:20,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:48:20" (4/4) ... [2022-04-27 22:48:20,840 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll.cqvasr [2022-04-27 22:48:20,849 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:48:20,849 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:48:20,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:48:20,890 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c12cd7c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@365b0737 [2022-04-27 22:48:20,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:48:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 22:48:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 22:48:20,899 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:48:20,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:48:20,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:48:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:48:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1885409022, now seen corresponding path program 1 times [2022-04-27 22:48:20,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:48:20,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033295027] [2022-04-27 22:48:20,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:48:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:48:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:48:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:21,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {31#true} is VALID [2022-04-27 22:48:21,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:48:21,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:48:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 22:48:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:21,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} [71] 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] {31#true} is VALID [2022-04-27 22:48:21,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [75] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 22:48:21,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 22:48:21,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#false} is VALID [2022-04-27 22:48:21,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:48:21,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {31#true} is VALID [2022-04-27 22:48:21,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:48:21,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:48:21,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 22:48:21,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {31#true} is VALID [2022-04-27 22:48:21,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {31#true} is VALID [2022-04-27 22:48:21,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} [71] 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] {31#true} is VALID [2022-04-27 22:48:21,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} [75] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 22:48:21,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 22:48:21,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#false} is VALID [2022-04-27 22:48:21,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {32#false} is VALID [2022-04-27 22:48:21,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} [72] L27-2-->L27-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 22:48:21,062 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} [77] L27-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] {32#false} is VALID [2022-04-27 22:48:21,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} [81] __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] {32#false} is VALID [2022-04-27 22:48:21,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 22:48:21,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 22:48:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:48:21,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:48:21,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033295027] [2022-04-27 22:48:21,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033295027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:48:21,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:48:21,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:48:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559266720] [2022-04-27 22:48:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:48:21,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 22:48:21,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:48:21,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:48:21,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:48:21,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:48:21,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:48:21,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:48:21,118 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:21,211 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 22:48:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:48:21,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 22:48:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:48:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 22:48:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 22:48:21,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-27 22:48:21,277 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 22:48:21,282 INFO L225 Difference]: With dead ends: 47 [2022-04-27 22:48:21,283 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 22:48:21,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:48:21,287 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:48:21,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:48:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 22:48:21,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 22:48:21,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:48:21,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:48:21,307 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:48:21,308 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:48:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:21,311 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 22:48:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 22:48:21,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:21,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:21,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 22:48:21,312 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 22:48:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:21,314 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 22:48:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 22:48:21,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:21,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:21,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:48:21,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:48:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 22:48:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 22:48:21,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-27 22:48:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:48:21,318 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 22:48:21,318 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 22:48:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 22:48:21,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:48:21,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:48:21,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:48:21,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:48:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:48:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 603980644, now seen corresponding path program 1 times [2022-04-27 22:48:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:48:21,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818676910] [2022-04-27 22:48:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:48:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:48:21,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:48:21,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947108438] [2022-04-27 22:48:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:48:21,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:48:21,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:48:21,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:48:21,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:48:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:21,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 22:48:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:21,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:48:21,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 22:48:21,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} [65] 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] {186#true} is VALID [2022-04-27 22:48:21,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 22:48:21,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 22:48:21,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 22:48:21,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {186#true} is VALID [2022-04-27 22:48:21,523 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {186#true} is VALID [2022-04-27 22:48:21,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} [71] 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] {186#true} is VALID [2022-04-27 22:48:21,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 22:48:21,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 22:48:21,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {186#true} {186#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {186#true} is VALID [2022-04-27 22:48:21,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:21,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:21,525 INFO L272 TraceCheckUtils]: 13: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} [78] L28-->__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] {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:48:21,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:48:21,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {187#false} is VALID [2022-04-27 22:48:21,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#false} is VALID [2022-04-27 22:48:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:48:21,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:48:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:48:21,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818676910] [2022-04-27 22:48:21,528 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:48:21,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947108438] [2022-04-27 22:48:21,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947108438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:48:21,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:48:21,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 22:48:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722099644] [2022-04-27 22:48:21,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:48:21,533 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 22:48:21,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:48:21,534 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:48:21,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:48:21,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:48:21,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:48:21,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:48:21,547 INFO L87 Difference]: Start difference. First operand 23 states and 25 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:21,641 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 22:48:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:48:21,642 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 22:48:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:48:21,642 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 22:48:21,644 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 22:48:21,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 22:48:21,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:48:21,672 INFO L225 Difference]: With dead ends: 34 [2022-04-27 22:48:21,672 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 22:48:21,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 22:48:21,673 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 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 22:48:21,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:48:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 22:48:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 22:48:21,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:48:21,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:48:21,678 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:48:21,679 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:48:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:21,680 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 22:48:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 22:48:21,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:21,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:21,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 22:48:21,681 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 22:48:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:21,683 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 22:48:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 22:48:21,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:21,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:21,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:48:21,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:48:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:48:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 22:48:21,685 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 22:48:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:48:21,685 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 22:48:21,685 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:48:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 22:48:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 22:48:21,685 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:48:21,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:48:21,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 22:48:21,904 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 22:48:21,904 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:48:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:48:21,905 INFO L85 PathProgramCache]: Analyzing trace with hash -169450186, now seen corresponding path program 1 times [2022-04-27 22:48:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:48:21,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078545663] [2022-04-27 22:48:21,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:48:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:48:21,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:48:21,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917804602] [2022-04-27 22:48:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:48:21,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:48:21,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:48:21,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:48:21,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 22:48:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:21,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 22:48:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:21,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:48:22,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:22,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} [65] 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] {397#true} is VALID [2022-04-27 22:48:22,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:22,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:22,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:22,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {397#true} is VALID [2022-04-27 22:48:22,133 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {397#true} is VALID [2022-04-27 22:48:22,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} [71] 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] {397#true} is VALID [2022-04-27 22:48:22,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:22,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:22,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {397#true} is VALID [2022-04-27 22:48:22,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:22,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:22,142 INFO L272 TraceCheckUtils]: 13: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} [78] L28-->__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] {397#true} is VALID [2022-04-27 22:48:22,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} [81] __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] {397#true} is VALID [2022-04-27 22:48:22,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:22,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:22,145 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {435#(and (= main_~x~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-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] {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:22,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {457#(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 22:48:22,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#(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 22:48:22,147 INFO L272 TraceCheckUtils]: 20: Hoare triple {457#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} [78] L28-->__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] {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:48:22,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:48:22,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-27 22:48:22,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-27 22:48:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:48:22,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:48:22,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-27 22:48:22,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-27 22:48:22,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:48:22,417 INFO L272 TraceCheckUtils]: 20: Hoare triple {484#(= (+ 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)))} [78] L28-->__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] {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:48:22,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#(= (+ 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 22:48:24,432 WARN L290 TraceCheckUtils]: 18: Hoare triple {484#(= (+ 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] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-27 22:48:24,444 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {484#(= (+ 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)))} [94] __VERIFIER_assertEXIT-->L28-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] {484#(= (+ 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 22:48:24,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:24,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:24,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} [81] __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] {397#true} is VALID [2022-04-27 22:48:24,445 INFO L272 TraceCheckUtils]: 13: Hoare triple {484#(= (+ 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)))} [78] L28-->__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] {397#true} is VALID [2022-04-27 22:48:24,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#(= (+ 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 22:48:24,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {484#(= (+ 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 22:48:24,451 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {397#true} is VALID [2022-04-27 22:48:24,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:24,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:24,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} [71] 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] {397#true} is VALID [2022-04-27 22:48:24,451 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {397#true} is VALID [2022-04-27 22:48:24,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {397#true} is VALID [2022-04-27 22:48:24,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:24,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:24,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:24,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} [65] 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] {397#true} is VALID [2022-04-27 22:48:24,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-27 22:48:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 22:48:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:48:24,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078545663] [2022-04-27 22:48:24,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:48:24,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917804602] [2022-04-27 22:48:24,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917804602] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:48:24,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:48:24,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 22:48:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12321055] [2022-04-27 22:48:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:48:24,454 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 22:48:24,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:48:24,454 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:48:24,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:48:24,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:48:24,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:48:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:48:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 22:48:24,930 INFO L87 Difference]: Start difference. First operand 30 states and 32 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:48:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:25,039 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-27 22:48:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:48:25,040 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 22:48:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:48:25,040 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:48:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 22:48:25,042 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:48:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 22:48:25,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 22:48:25,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:48:25,277 INFO L225 Difference]: With dead ends: 36 [2022-04-27 22:48:25,277 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 22:48:25,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:48:25,278 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 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 22:48:25,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:48:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 22:48:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 22:48:25,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:48:25,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:48:25,284 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:48:25,284 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:48:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:25,286 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 22:48:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 22:48:25,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:25,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:25,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 22:48:25,287 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 22:48:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:25,288 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 22:48:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 22:48:25,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:25,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:25,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:48:25,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:48:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 22:48:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-27 22:48:25,290 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2022-04-27 22:48:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:48:25,290 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-27 22:48:25,290 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:48:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 22:48:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 22:48:25,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:48:25,291 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:48:25,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 22:48:25,495 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 22:48:25,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:48:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:48:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -124222480, now seen corresponding path program 1 times [2022-04-27 22:48:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:48:25,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032477453] [2022-04-27 22:48:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:48:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:48:25,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:48:25,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913264462] [2022-04-27 22:48:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:48:25,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:48:25,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:48:25,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:48:25,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 22:48:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:25,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 22:48:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:25,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:48:25,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {711#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} [65] 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] {711#true} is VALID [2022-04-27 22:48:25,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {711#true} {711#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {711#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {711#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {711#true} is VALID [2022-04-27 22:48:25,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {711#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {711#true} is VALID [2022-04-27 22:48:25,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {711#true} [71] 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] {711#true} is VALID [2022-04-27 22:48:25,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {711#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {711#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,849 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {711#true} {711#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {711#true} is VALID [2022-04-27 22:48:25,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {711#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:25,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {749#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:25,852 INFO L272 TraceCheckUtils]: 13: Hoare triple {749#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__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] {711#true} is VALID [2022-04-27 22:48:25,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {711#true} [81] __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] {711#true} is VALID [2022-04-27 22:48:25,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {711#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {711#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,854 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {711#true} {749#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-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] {749#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:25,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {749#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 22:48:25,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 22:48:25,856 INFO L272 TraceCheckUtils]: 20: Hoare triple {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [78] L28-->__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] {711#true} is VALID [2022-04-27 22:48:25,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {711#true} [81] __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] {711#true} is VALID [2022-04-27 22:48:25,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {711#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {711#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,857 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {711#true} {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [94] __VERIFIER_assertEXIT-->L28-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] {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 22:48:25,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {771#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {793#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 22:48:25,858 INFO L272 TraceCheckUtils]: 26: Hoare triple {793#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [77] L27-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] {711#true} is VALID [2022-04-27 22:48:25,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {711#true} [81] __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] {711#true} is VALID [2022-04-27 22:48:25,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {711#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {711#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#true} is VALID [2022-04-27 22:48:25,866 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {711#true} {793#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [95] __VERIFIER_assertEXIT-->L38: 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] {793#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 22:48:25,869 INFO L272 TraceCheckUtils]: 31: Hoare triple {793#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [80] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {812#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:48:25,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {812#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {816#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:48:25,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {816#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {712#false} is VALID [2022-04-27 22:48:25,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {712#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#false} is VALID [2022-04-27 22:48:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 22:48:25,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:48:26,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:48:26,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032477453] [2022-04-27 22:48:26,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:48:26,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913264462] [2022-04-27 22:48:26,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913264462] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:48:26,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:48:26,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 22:48:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449752046] [2022-04-27 22:48:26,181 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 22:48:26,181 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-27 22:48:26,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:48:26,182 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 22:48:26,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:48:26,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 22:48:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:48:26,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 22:48:26,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 22:48:26,202 INFO L87 Difference]: Start difference. First operand 32 states and 33 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 22:48:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:26,381 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-27 22:48:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:48:26,382 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-27 22:48:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:48:26,382 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 22:48:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-27 22:48:26,383 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 22:48:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-27 22:48:26,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-27 22:48:26,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:48:26,423 INFO L225 Difference]: With dead ends: 41 [2022-04-27 22:48:26,423 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 22:48:26,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 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 22:48:26,424 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:48:26,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:48:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 22:48:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 22:48:26,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:48:26,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 22:48:26,435 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 22:48:26,436 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 22:48:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:26,437 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-27 22:48:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-27 22:48:26,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:26,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:26,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 35 states. [2022-04-27 22:48:26,438 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 35 states. [2022-04-27 22:48:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:26,441 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-27 22:48:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-27 22:48:26,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:26,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:26,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:48:26,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:48:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 22:48:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-27 22:48:26,447 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 35 [2022-04-27 22:48:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:48:26,448 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-27 22:48:26,449 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 22:48:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-27 22:48:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 22:48:26,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:48:26,450 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:48:26,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 22:48:26,655 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 22:48:26,655 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:48:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:48:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1580411582, now seen corresponding path program 2 times [2022-04-27 22:48:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:48:26,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642492030] [2022-04-27 22:48:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:48:26,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:48:26,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:48:26,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265450641] [2022-04-27 22:48:26,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 22:48:26,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:48:26,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:48:26,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:48:26,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 22:48:26,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 22:48:26,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:48:26,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 22:48:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:48:26,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:48:26,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} [65] 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] {1066#true} is VALID [2022-04-27 22:48:26,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {1066#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {1066#true} is VALID [2022-04-27 22:48:26,987 INFO L272 TraceCheckUtils]: 6: Hoare triple {1066#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1066#true} is VALID [2022-04-27 22:48:26,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} [71] 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] {1066#true} is VALID [2022-04-27 22:48:26,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,988 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1066#true} {1066#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1066#true} is VALID [2022-04-27 22:48:26,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {1066#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1104#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:26,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {1104#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:26,988 INFO L272 TraceCheckUtils]: 13: Hoare triple {1104#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__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] {1066#true} is VALID [2022-04-27 22:48:26,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {1066#true} [81] __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] {1066#true} is VALID [2022-04-27 22:48:26,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {1066#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {1066#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,989 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1066#true} {1104#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-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] {1104#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:48:26,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1126#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 22:48:26,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {1126#(and (= main_~y~0 1) (= main_~c~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1126#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 22:48:26,990 INFO L272 TraceCheckUtils]: 20: Hoare triple {1126#(and (= main_~y~0 1) (= main_~c~0 1))} [78] L28-->__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] {1066#true} is VALID [2022-04-27 22:48:26,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {1066#true} [81] __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] {1066#true} is VALID [2022-04-27 22:48:26,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {1066#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {1066#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,991 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1066#true} {1126#(and (= main_~y~0 1) (= main_~c~0 1))} [94] __VERIFIER_assertEXIT-->L28-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] {1126#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 22:48:26,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#(and (= main_~y~0 1) (= main_~c~0 1))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 22:48:26,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 22:48:26,991 INFO L272 TraceCheckUtils]: 27: Hoare triple {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [78] L28-->__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] {1066#true} is VALID [2022-04-27 22:48:26,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {1066#true} [81] __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] {1066#true} is VALID [2022-04-27 22:48:26,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {1066#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {1066#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,992 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1066#true} {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [94] __VERIFIER_assertEXIT-->L28-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] {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 22:48:26,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {1148#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {1170#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 22:48:26,993 INFO L272 TraceCheckUtils]: 33: Hoare triple {1170#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [77] L27-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] {1066#true} is VALID [2022-04-27 22:48:26,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {1066#true} [81] __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] {1066#true} is VALID [2022-04-27 22:48:26,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {1066#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {1066#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-27 22:48:26,994 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1066#true} {1170#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [95] __VERIFIER_assertEXIT-->L38: 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] {1170#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 22:48:26,994 INFO L272 TraceCheckUtils]: 38: Hoare triple {1170#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [80] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:48:26,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:48:26,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1067#false} is VALID [2022-04-27 22:48:26,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {1067#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#false} is VALID [2022-04-27 22:48:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 22:48:26,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:48:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:48:27,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642492030] [2022-04-27 22:48:27,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:48:27,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265450641] [2022-04-27 22:48:27,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265450641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:48:27,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:48:27,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 22:48:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274562773] [2022-04-27 22:48:27,258 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 22:48:27,258 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-27 22:48:27,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:48:27,259 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 22:48:27,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:48:27,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 22:48:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:48:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 22:48:27,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:48:27,285 INFO L87 Difference]: Start difference. First operand 35 states and 37 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 22:48:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:27,523 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-27 22:48:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 22:48:27,523 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-27 22:48:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:48:27,523 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 22:48:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 22:48:27,525 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 22:48:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 22:48:27,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-27 22:48:27,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:48:27,556 INFO L225 Difference]: With dead ends: 44 [2022-04-27 22:48:27,556 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 22:48:27,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 22:48:27,557 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:48:27,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 154 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:48:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 22:48:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 22:48:27,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:48:27,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 22:48:27,569 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 22:48:27,569 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 22:48:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:27,570 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 22:48:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 22:48:27,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:27,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:27,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 38 states. [2022-04-27 22:48:27,571 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 38 states. [2022-04-27 22:48:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:48:27,572 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 22:48:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 22:48:27,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:48:27,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:48:27,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:48:27,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:48:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 22:48:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-27 22:48:27,574 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 42 [2022-04-27 22:48:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:48:27,574 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-27 22:48:27,574 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 22:48:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 22:48:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 22:48:27,575 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:48:27,575 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:48:27,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 22:48:27,779 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 22:48:27,779 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:48:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:48:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2070660016, now seen corresponding path program 3 times [2022-04-27 22:48:27,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:48:27,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433071184] [2022-04-27 22:48:27,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:48:27,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:48:27,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:48:27,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496394537] [2022-04-27 22:48:27,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 22:48:27,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:48:27,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:48:27,814 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 22:48:27,815 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 22:57:14,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 22:57:14,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:57:14,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 22:57:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:57:14,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:57:15,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {1459#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1459#true} [65] 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] {1459#true} is VALID [2022-04-27 22:57:15,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {1459#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {1459#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {1459#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {1459#true} is VALID [2022-04-27 22:57:15,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {1459#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1459#true} is VALID [2022-04-27 22:57:15,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {1459#true} [71] 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] {1459#true} is VALID [2022-04-27 22:57:15,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {1459#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {1459#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,311 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1459#true} {1459#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1459#true} is VALID [2022-04-27 22:57:15,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {1459#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1497#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:57:15,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {1497#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1497#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:57:15,312 INFO L272 TraceCheckUtils]: 13: Hoare triple {1497#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__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] {1459#true} is VALID [2022-04-27 22:57:15,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {1459#true} [81] __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] {1459#true} is VALID [2022-04-27 22:57:15,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {1459#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {1459#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,312 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1459#true} {1497#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-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] {1497#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:57:15,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {1497#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 22:57:15,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 22:57:15,313 INFO L272 TraceCheckUtils]: 20: Hoare triple {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-->__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] {1459#true} is VALID [2022-04-27 22:57:15,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {1459#true} [81] __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] {1459#true} is VALID [2022-04-27 22:57:15,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {1459#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {1459#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,314 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1459#true} {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [94] __VERIFIER_assertEXIT-->L28-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] {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 22:57:15,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {1519#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 22:57:15,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 22:57:15,315 INFO L272 TraceCheckUtils]: 27: Hoare triple {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [78] L28-->__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] {1459#true} is VALID [2022-04-27 22:57:15,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {1459#true} [81] __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] {1459#true} is VALID [2022-04-27 22:57:15,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {1459#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {1459#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,316 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1459#true} {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [94] __VERIFIER_assertEXIT-->L28-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] {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 22:57:15,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {1541#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 22:57:15,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 22:57:15,317 INFO L272 TraceCheckUtils]: 34: Hoare triple {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [78] L28-->__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] {1459#true} is VALID [2022-04-27 22:57:15,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {1459#true} [81] __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] {1459#true} is VALID [2022-04-27 22:57:15,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {1459#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {1459#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,318 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1459#true} {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-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] {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 22:57:15,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {1563#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {1585#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 22:57:15,318 INFO L272 TraceCheckUtils]: 40: Hoare triple {1585#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [77] L27-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] {1459#true} is VALID [2022-04-27 22:57:15,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {1459#true} [81] __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] {1459#true} is VALID [2022-04-27 22:57:15,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {1459#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {1459#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1459#true} is VALID [2022-04-27 22:57:15,319 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1459#true} {1585#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [95] __VERIFIER_assertEXIT-->L38: 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] {1585#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 22:57:15,320 INFO L272 TraceCheckUtils]: 45: Hoare triple {1585#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [80] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:57:15,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {1604#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {1608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:57:15,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {1608#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1460#false} is VALID [2022-04-27 22:57:15,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {1460#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1460#false} is VALID [2022-04-27 22:57:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 22:57:15,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:57:15,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:57:15,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433071184] [2022-04-27 22:57:15,586 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:57:15,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496394537] [2022-04-27 22:57:15,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496394537] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:57:15,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:57:15,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 22:57:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731421746] [2022-04-27 22:57:15,587 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 22:57:15,587 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 49 [2022-04-27 22:57:15,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:57:15,587 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 22:57:15,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:57:15,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 22:57:15,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:57:15,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 22:57:15,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:57:15,617 INFO L87 Difference]: Start difference. First operand 38 states and 41 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 22:57:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:57:15,948 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-27 22:57:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 22:57:15,949 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 49 [2022-04-27 22:57:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:57:15,949 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 22:57:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-27 22:57:15,950 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 22:57:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-27 22:57:15,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-27 22:57:15,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:57:15,986 INFO L225 Difference]: With dead ends: 47 [2022-04-27 22:57:15,986 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 22:57:15,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 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 22:57:15,987 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:57:15,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 185 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:57:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 22:57:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 22:57:16,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:57:16,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 22:57:16,001 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 22:57:16,001 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 22:57:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:57:16,003 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-27 22:57:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-27 22:57:16,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:57:16,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:57:16,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 41 states. [2022-04-27 22:57:16,003 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 41 states. [2022-04-27 22:57:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:57:16,006 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-27 22:57:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-27 22:57:16,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:57:16,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:57:16,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:57:16,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:57:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 22:57:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-27 22:57:16,009 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 49 [2022-04-27 22:57:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:57:16,009 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-27 22:57:16,009 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 22:57:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-27 22:57:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 22:57:16,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:57:16,010 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:57:16,078 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 22:57:16,219 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 22:57:16,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:57:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:57:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 780557698, now seen corresponding path program 4 times [2022-04-27 22:57:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:57:16,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485645103] [2022-04-27 22:57:16,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:57:16,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:57:16,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:57:16,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879211010] [2022-04-27 22:57:16,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 22:57:16,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:57:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:57:16,236 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 22:57:16,237 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 22:57:16,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 22:57:16,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:57:16,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 22:57:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:57:16,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:57:16,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {1890#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {1890#true} [65] 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] {1890#true} is VALID [2022-04-27 22:57:16,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {1890#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {1890#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {1890#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {1890#true} is VALID [2022-04-27 22:57:16,614 INFO L272 TraceCheckUtils]: 6: Hoare triple {1890#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1890#true} is VALID [2022-04-27 22:57:16,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {1890#true} [71] 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] {1890#true} is VALID [2022-04-27 22:57:16,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {1890#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {1890#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1890#true} {1890#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1890#true} is VALID [2022-04-27 22:57:16,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {1890#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1928#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:57:16,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {1928#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1928#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:57:16,617 INFO L272 TraceCheckUtils]: 13: Hoare triple {1928#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__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] {1890#true} is VALID [2022-04-27 22:57:16,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {1890#true} [81] __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] {1890#true} is VALID [2022-04-27 22:57:16,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {1890#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {1890#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,618 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1890#true} {1928#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-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] {1928#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:57:16,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {1928#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 22:57:16,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 22:57:16,618 INFO L272 TraceCheckUtils]: 20: Hoare triple {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [78] L28-->__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] {1890#true} is VALID [2022-04-27 22:57:16,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {1890#true} [81] __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] {1890#true} is VALID [2022-04-27 22:57:16,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {1890#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {1890#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,619 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1890#true} {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [94] __VERIFIER_assertEXIT-->L28-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] {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 22:57:16,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {1950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 22:57:16,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 22:57:16,620 INFO L272 TraceCheckUtils]: 27: Hoare triple {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [78] L28-->__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] {1890#true} is VALID [2022-04-27 22:57:16,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {1890#true} [81] __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] {1890#true} is VALID [2022-04-27 22:57:16,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {1890#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {1890#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,621 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1890#true} {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [94] __VERIFIER_assertEXIT-->L28-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] {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 22:57:16,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {1972#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 22:57:16,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 22:57:16,624 INFO L272 TraceCheckUtils]: 34: Hoare triple {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} [78] L28-->__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] {1890#true} is VALID [2022-04-27 22:57:16,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {1890#true} [81] __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] {1890#true} is VALID [2022-04-27 22:57:16,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {1890#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {1890#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,625 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1890#true} {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} [94] __VERIFIER_assertEXIT-->L28-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] {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 22:57:16,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {1994#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 22:57:16,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 22:57:16,638 INFO L272 TraceCheckUtils]: 41: Hoare triple {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [78] L28-->__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] {1890#true} is VALID [2022-04-27 22:57:16,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {1890#true} [81] __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] {1890#true} is VALID [2022-04-27 22:57:16,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {1890#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {1890#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,640 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1890#true} {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 22:57:16,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {2016#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {2038#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 22:57:16,641 INFO L272 TraceCheckUtils]: 47: Hoare triple {2038#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [77] L27-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] {1890#true} is VALID [2022-04-27 22:57:16,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {1890#true} [81] __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] {1890#true} is VALID [2022-04-27 22:57:16,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {1890#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {1890#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#true} is VALID [2022-04-27 22:57:16,641 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1890#true} {2038#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [95] __VERIFIER_assertEXIT-->L38: 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] {2038#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 22:57:16,642 INFO L272 TraceCheckUtils]: 52: Hoare triple {2038#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [80] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2057#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:57:16,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {2057#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {2061#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:57:16,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {2061#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1891#false} is VALID [2022-04-27 22:57:16,643 INFO L290 TraceCheckUtils]: 55: Hoare triple {1891#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1891#false} is VALID [2022-04-27 22:57:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 22:57:16,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:57:16,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:57:16,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485645103] [2022-04-27 22:57:16,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:57:16,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879211010] [2022-04-27 22:57:16,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879211010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:57:16,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:57:16,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 22:57:16,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099473527] [2022-04-27 22:57:16,882 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 22:57:16,883 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-04-27 22:57:16,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:57:16,883 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 22:57:16,909 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 22:57:16,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 22:57:16,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:57:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 22:57:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 22:57:16,910 INFO L87 Difference]: Start difference. First operand 41 states and 45 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 22:57:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:57:17,291 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-04-27 22:57:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 22:57:17,292 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-04-27 22:57:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:57:17,292 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 22:57:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-27 22:57:17,293 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 22:57:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-27 22:57:17,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-04-27 22:57:17,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:57:17,338 INFO L225 Difference]: With dead ends: 50 [2022-04-27 22:57:17,338 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 22:57:17,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 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 22:57:17,338 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:57:17,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 218 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:57:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 22:57:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 22:57:17,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:57:17,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 22:57:17,352 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 22:57:17,352 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 22:57:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:57:17,353 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-27 22:57:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-27 22:57:17,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:57:17,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:57:17,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 44 states. [2022-04-27 22:57:17,354 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 44 states. [2022-04-27 22:57:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:57:17,355 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-27 22:57:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-27 22:57:17,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:57:17,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:57:17,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:57:17,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:57:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 22:57:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-04-27 22:57:17,357 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 56 [2022-04-27 22:57:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:57:17,357 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-04-27 22:57:17,357 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 22:57:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-27 22:57:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 22:57:17,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:57:17,357 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:57:17,374 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 22:57:17,571 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 22:57:17,571 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:57:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:57:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1957983088, now seen corresponding path program 5 times [2022-04-27 22:57:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:57:17,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500078023] [2022-04-27 22:57:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:57:17,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:57:17,580 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:57:17,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194686691] [2022-04-27 22:57:17,580 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 22:57:17,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:57:17,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:57:17,581 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 22:57:17,582 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 22:58:28,113 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 22:58:28,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:58:28,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 22:58:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:58:28,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:58:28,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#true} [65] 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] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} [71] 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] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {2359#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {2359#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,507 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2359#true} {2359#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2359#true} is VALID [2022-04-27 22:58:28,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {2359#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2397#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:58:28,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {2397#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2397#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:58:28,508 INFO L272 TraceCheckUtils]: 13: Hoare triple {2397#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__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] {2359#true} is VALID [2022-04-27 22:58:28,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} [81] __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] {2359#true} is VALID [2022-04-27 22:58:28,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {2359#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,509 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2359#true} {2397#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-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] {2397#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:58:28,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {2397#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 22:58:28,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 22:58:28,510 INFO L272 TraceCheckUtils]: 20: Hoare triple {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-->__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] {2359#true} is VALID [2022-04-27 22:58:28,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {2359#true} [81] __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] {2359#true} is VALID [2022-04-27 22:58:28,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {2359#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,511 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2359#true} {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [94] __VERIFIER_assertEXIT-->L28-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] {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 22:58:28,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {2419#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 22:58:28,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 22:58:28,513 INFO L272 TraceCheckUtils]: 27: Hoare triple {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [78] L28-->__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] {2359#true} is VALID [2022-04-27 22:58:28,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {2359#true} [81] __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] {2359#true} is VALID [2022-04-27 22:58:28,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {2359#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {2359#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,513 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2359#true} {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [94] __VERIFIER_assertEXIT-->L28-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] {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 22:58:28,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {2441#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 22:58:28,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 22:58:28,515 INFO L272 TraceCheckUtils]: 34: Hoare triple {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [78] L28-->__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] {2359#true} is VALID [2022-04-27 22:58:28,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} [81] __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] {2359#true} is VALID [2022-04-27 22:58:28,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {2359#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {2359#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,516 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2359#true} {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [94] __VERIFIER_assertEXIT-->L28-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] {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 22:58:28,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {2463#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 22:58:28,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 22:58:28,517 INFO L272 TraceCheckUtils]: 41: Hoare triple {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [78] L28-->__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] {2359#true} is VALID [2022-04-27 22:58:28,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {2359#true} [81] __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] {2359#true} is VALID [2022-04-27 22:58:28,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {2359#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {2359#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,517 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2359#true} {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [94] __VERIFIER_assertEXIT-->L28-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] {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 22:58:28,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {2485#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 22:58:28,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 22:58:28,518 INFO L272 TraceCheckUtils]: 48: Hoare triple {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [78] L28-->__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] {2359#true} is VALID [2022-04-27 22:58:28,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {2359#true} [81] __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] {2359#true} is VALID [2022-04-27 22:58:28,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {2359#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {2359#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,519 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2359#true} {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-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] {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 22:58:28,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {2507#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {2529#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 22:58:28,520 INFO L272 TraceCheckUtils]: 54: Hoare triple {2529#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [77] L27-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] {2359#true} is VALID [2022-04-27 22:58:28,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {2359#true} [81] __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] {2359#true} is VALID [2022-04-27 22:58:28,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {2359#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {2359#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2359#true} is VALID [2022-04-27 22:58:28,525 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2359#true} {2529#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [95] __VERIFIER_assertEXIT-->L38: 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] {2529#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 22:58:28,525 INFO L272 TraceCheckUtils]: 59: Hoare triple {2529#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [80] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:58:28,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:58:28,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2360#false} is VALID [2022-04-27 22:58:28,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {2360#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2360#false} is VALID [2022-04-27 22:58:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 22:58:28,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:58:28,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:58:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500078023] [2022-04-27 22:58:28,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:58:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194686691] [2022-04-27 22:58:28,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194686691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:58:28,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:58:28,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 22:58:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882110732] [2022-04-27 22:58:28,846 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 22:58:28,846 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 63 [2022-04-27 22:58:28,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:58:28,847 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 22:58:28,887 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 22:58:28,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 22:58:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:58:28,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 22:58:28,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 22:58:28,887 INFO L87 Difference]: Start difference. First operand 44 states and 49 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 22:58:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:58:29,369 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-04-27 22:58:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 22:58:29,370 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 63 [2022-04-27 22:58:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:58:29,370 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 22:58:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-27 22:58:29,371 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 22:58:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-27 22:58:29,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2022-04-27 22:58:29,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:58:29,411 INFO L225 Difference]: With dead ends: 53 [2022-04-27 22:58:29,411 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 22:58:29,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 22:58:29,412 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:58:29,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 253 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 22:58:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 22:58:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 22:58:29,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:58:29,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 22:58:29,429 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 22:58:29,430 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 22:58:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:58:29,432 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-27 22:58:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-27 22:58:29,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:58:29,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:58:29,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 47 states. [2022-04-27 22:58:29,433 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 47 states. [2022-04-27 22:58:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:58:29,434 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-27 22:58:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-27 22:58:29,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:58:29,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:58:29,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:58:29,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:58:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 22:58:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-04-27 22:58:29,441 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 63 [2022-04-27 22:58:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:58:29,442 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-04-27 22:58:29,442 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 22:58:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-27 22:58:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 22:58:29,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:58:29,444 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:58:29,459 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 22:58:29,644 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 22:58:29,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:58:29,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:58:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1966311998, now seen corresponding path program 6 times [2022-04-27 22:58:29,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:58:29,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724743270] [2022-04-27 22:58:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:58:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:58:29,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:58:29,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873227703] [2022-04-27 22:58:29,654 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 22:58:29,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:58:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:58:29,654 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 22:58:29,655 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 22:58:43,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 22:58:43,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:58:43,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 22:58:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:58:43,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:58:43,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {2866#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {2866#true} [65] 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] {2866#true} is VALID [2022-04-27 22:58:43,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {2866#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2866#true} {2866#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {2866#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {2866#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {2866#true} is VALID [2022-04-27 22:58:43,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {2866#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2866#true} is VALID [2022-04-27 22:58:43,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {2866#true} [71] 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] {2866#true} is VALID [2022-04-27 22:58:43,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {2866#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {2866#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2866#true} {2866#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2866#true} is VALID [2022-04-27 22:58:43,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {2866#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2904#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:58:43,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {2904#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2904#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:58:43,738 INFO L272 TraceCheckUtils]: 13: Hoare triple {2904#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__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] {2866#true} is VALID [2022-04-27 22:58:43,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {2866#true} [81] __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] {2866#true} is VALID [2022-04-27 22:58:43,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {2866#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {2866#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,738 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2866#true} {2904#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-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] {2904#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:58:43,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {2904#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 22:58:43,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 22:58:43,739 INFO L272 TraceCheckUtils]: 20: Hoare triple {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [78] L28-->__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] {2866#true} is VALID [2022-04-27 22:58:43,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {2866#true} [81] __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] {2866#true} is VALID [2022-04-27 22:58:43,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {2866#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {2866#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,740 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2866#true} {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [94] __VERIFIER_assertEXIT-->L28-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] {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 22:58:43,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {2926#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 22:58:43,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 22:58:43,740 INFO L272 TraceCheckUtils]: 27: Hoare triple {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [78] L28-->__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] {2866#true} is VALID [2022-04-27 22:58:43,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {2866#true} [81] __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] {2866#true} is VALID [2022-04-27 22:58:43,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {2866#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {2866#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,741 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2866#true} {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [94] __VERIFIER_assertEXIT-->L28-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] {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-27 22:58:43,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {2948#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 22:58:43,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 22:58:43,742 INFO L272 TraceCheckUtils]: 34: Hoare triple {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} [78] L28-->__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] {2866#true} is VALID [2022-04-27 22:58:43,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {2866#true} [81] __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] {2866#true} is VALID [2022-04-27 22:58:43,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {2866#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {2866#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,743 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2866#true} {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} [94] __VERIFIER_assertEXIT-->L28-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] {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-27 22:58:43,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {2970#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2992#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 22:58:43,743 INFO L290 TraceCheckUtils]: 40: Hoare triple {2992#(and (= main_~y~0 4) (= main_~c~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2992#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 22:58:43,743 INFO L272 TraceCheckUtils]: 41: Hoare triple {2992#(and (= main_~y~0 4) (= main_~c~0 4))} [78] L28-->__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] {2866#true} is VALID [2022-04-27 22:58:43,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {2866#true} [81] __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] {2866#true} is VALID [2022-04-27 22:58:43,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {2866#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {2866#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,758 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2866#true} {2992#(and (= main_~y~0 4) (= main_~c~0 4))} [94] __VERIFIER_assertEXIT-->L28-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] {2992#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 22:58:43,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {2992#(and (= main_~y~0 4) (= main_~c~0 4))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 22:58:43,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 22:58:43,764 INFO L272 TraceCheckUtils]: 48: Hoare triple {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} [78] L28-->__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] {2866#true} is VALID [2022-04-27 22:58:43,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {2866#true} [81] __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] {2866#true} is VALID [2022-04-27 22:58:43,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {2866#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {2866#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,765 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2866#true} {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} [94] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ (* (- 1) v_main_~y~0_8) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 15)))) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8)) (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 10))) (* v_main_~x~0_7 (- 30))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 22:58:43,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {3014#(and (= 5 main_~c~0) (= 5 main_~y~0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 22:58:43,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 22:58:43,766 INFO L272 TraceCheckUtils]: 55: Hoare triple {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [78] L28-->__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] {2866#true} is VALID [2022-04-27 22:58:43,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {2866#true} [81] __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] {2866#true} is VALID [2022-04-27 22:58:43,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {2866#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {2866#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,767 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2866#true} {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [94] __VERIFIER_assertEXIT-->L28-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] {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 22:58:43,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {3036#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {3058#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 22:58:43,767 INFO L272 TraceCheckUtils]: 61: Hoare triple {3058#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [77] L27-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] {2866#true} is VALID [2022-04-27 22:58:43,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {2866#true} [81] __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] {2866#true} is VALID [2022-04-27 22:58:43,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {2866#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {2866#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2866#true} is VALID [2022-04-27 22:58:43,768 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {2866#true} {3058#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [95] __VERIFIER_assertEXIT-->L38: 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] {3058#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 22:58:43,769 INFO L272 TraceCheckUtils]: 66: Hoare triple {3058#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [80] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3077#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:58:43,769 INFO L290 TraceCheckUtils]: 67: Hoare triple {3077#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {3081#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:58:43,769 INFO L290 TraceCheckUtils]: 68: Hoare triple {3081#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2867#false} is VALID [2022-04-27 22:58:43,769 INFO L290 TraceCheckUtils]: 69: Hoare triple {2867#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2867#false} is VALID [2022-04-27 22:58:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 22:58:43,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:58:44,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:58:44,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724743270] [2022-04-27 22:58:44,059 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:58:44,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873227703] [2022-04-27 22:58:44,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873227703] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:58:44,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:58:44,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 22:58:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152707081] [2022-04-27 22:58:44,060 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 22:58:44,060 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 70 [2022-04-27 22:58:44,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:58:44,061 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 22:58:44,094 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 22:58:44,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 22:58:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:58:44,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 22:58:44,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 22:58:44,095 INFO L87 Difference]: Start difference. First operand 47 states and 53 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 22:58:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:58:44,677 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-04-27 22:58:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 22:58:44,677 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 70 [2022-04-27 22:58:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:58:44,678 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 22:58:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-27 22:58:44,679 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 22:58:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-27 22:58:44,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2022-04-27 22:58:44,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:58:44,725 INFO L225 Difference]: With dead ends: 56 [2022-04-27 22:58:44,725 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 22:58:44,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 22:58:44,726 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 22:58:44,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 22:58:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 22:58:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 22:58:44,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:58:44,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 22:58:44,748 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 22:58:44,748 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 22:58:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:58:44,750 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-27 22:58:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-27 22:58:44,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:58:44,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:58:44,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 50 states. [2022-04-27 22:58:44,750 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 50 states. [2022-04-27 22:58:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:58:44,751 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-27 22:58:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-27 22:58:44,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:58:44,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:58:44,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:58:44,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:58:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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 22:58:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-27 22:58:44,752 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 70 [2022-04-27 22:58:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:58:44,753 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-27 22:58:44,753 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 22:58:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-27 22:58:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 22:58:44,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:58:44,753 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:58:44,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 22:58:44,962 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 22:58:44,963 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:58:44,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:58:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash -231828688, now seen corresponding path program 7 times [2022-04-27 22:58:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:58:44,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349864765] [2022-04-27 22:58:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:58:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:58:44,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:58:44,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411631511] [2022-04-27 22:58:44,972 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 22:58:44,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:58:44,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:58:44,973 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 22:58:44,973 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 22:59:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:59:01,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 22:59:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:59:01,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:59:02,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {3411#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {3411#true} [65] 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] {3411#true} is VALID [2022-04-27 22:59:02,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {3411#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3411#true} {3411#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {3411#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {3411#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {3411#true} is VALID [2022-04-27 22:59:02,243 INFO L272 TraceCheckUtils]: 6: Hoare triple {3411#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3411#true} is VALID [2022-04-27 22:59:02,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {3411#true} [71] 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] {3411#true} is VALID [2022-04-27 22:59:02,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {3411#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {3411#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,243 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3411#true} {3411#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3411#true} is VALID [2022-04-27 22:59:02,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {3411#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {3449#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:59:02,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {3449#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3449#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:59:02,243 INFO L272 TraceCheckUtils]: 13: Hoare triple {3449#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__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] {3411#true} is VALID [2022-04-27 22:59:02,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {3411#true} [81] __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] {3411#true} is VALID [2022-04-27 22:59:02,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {3411#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {3411#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,244 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3411#true} {3449#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-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] {3449#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:59:02,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {3449#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 22:59:02,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 22:59:02,245 INFO L272 TraceCheckUtils]: 20: Hoare triple {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [78] L28-->__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] {3411#true} is VALID [2022-04-27 22:59:02,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {3411#true} [81] __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] {3411#true} is VALID [2022-04-27 22:59:02,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {3411#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {3411#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,245 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3411#true} {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [94] __VERIFIER_assertEXIT-->L28-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] {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 22:59:02,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {3471#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 22:59:02,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 22:59:02,246 INFO L272 TraceCheckUtils]: 27: Hoare triple {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [78] L28-->__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] {3411#true} is VALID [2022-04-27 22:59:02,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {3411#true} [81] __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] {3411#true} is VALID [2022-04-27 22:59:02,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {3411#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {3411#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,251 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3411#true} {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [94] __VERIFIER_assertEXIT-->L28-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] {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 22:59:02,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {3493#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3515#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 22:59:02,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {3515#(and (= main_~y~0 3) (= main_~c~0 3))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3515#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 22:59:02,262 INFO L272 TraceCheckUtils]: 34: Hoare triple {3515#(and (= main_~y~0 3) (= main_~c~0 3))} [78] L28-->__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] {3411#true} is VALID [2022-04-27 22:59:02,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {3411#true} [81] __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] {3411#true} is VALID [2022-04-27 22:59:02,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {3411#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {3411#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,263 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3411#true} {3515#(and (= main_~y~0 3) (= main_~c~0 3))} [94] __VERIFIER_assertEXIT-->L28-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] {3515#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 22:59:02,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {3515#(and (= main_~y~0 3) (= main_~c~0 3))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 22:59:02,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 22:59:02,264 INFO L272 TraceCheckUtils]: 41: Hoare triple {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [78] L28-->__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] {3411#true} is VALID [2022-04-27 22:59:02,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {3411#true} [81] __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] {3411#true} is VALID [2022-04-27 22:59:02,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {3411#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {3411#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,264 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3411#true} {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [94] __VERIFIER_assertEXIT-->L28-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] {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 22:59:02,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {3537#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 22:59:02,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 22:59:02,265 INFO L272 TraceCheckUtils]: 48: Hoare triple {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [78] L28-->__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] {3411#true} is VALID [2022-04-27 22:59:02,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {3411#true} [81] __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] {3411#true} is VALID [2022-04-27 22:59:02,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {3411#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {3411#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,266 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3411#true} {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [94] __VERIFIER_assertEXIT-->L28-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] {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-27 22:59:02,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {3559#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 22:59:02,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 22:59:02,267 INFO L272 TraceCheckUtils]: 55: Hoare triple {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [78] L28-->__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] {3411#true} is VALID [2022-04-27 22:59:02,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {3411#true} [81] __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] {3411#true} is VALID [2022-04-27 22:59:02,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {3411#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {3411#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,267 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3411#true} {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [94] __VERIFIER_assertEXIT-->L28-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] {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 22:59:02,268 INFO L290 TraceCheckUtils]: 60: Hoare triple {3581#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 22:59:02,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 22:59:02,268 INFO L272 TraceCheckUtils]: 62: Hoare triple {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [78] L28-->__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] {3411#true} is VALID [2022-04-27 22:59:02,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {3411#true} [81] __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] {3411#true} is VALID [2022-04-27 22:59:02,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {3411#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,268 INFO L290 TraceCheckUtils]: 65: Hoare triple {3411#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,269 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3411#true} {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-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] {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 22:59:02,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {3603#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 22:59:02,269 INFO L272 TraceCheckUtils]: 68: Hoare triple {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [77] L27-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] {3411#true} is VALID [2022-04-27 22:59:02,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {3411#true} [81] __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] {3411#true} is VALID [2022-04-27 22:59:02,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {3411#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {3411#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3411#true} is VALID [2022-04-27 22:59:02,270 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {3411#true} {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [95] __VERIFIER_assertEXIT-->L38: 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] {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-27 22:59:02,270 INFO L272 TraceCheckUtils]: 73: Hoare triple {3625#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [80] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3644#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:59:02,271 INFO L290 TraceCheckUtils]: 74: Hoare triple {3644#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {3648#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:59:02,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {3648#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3412#false} is VALID [2022-04-27 22:59:02,271 INFO L290 TraceCheckUtils]: 76: Hoare triple {3412#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3412#false} is VALID [2022-04-27 22:59:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 22:59:02,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:59:02,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:59:02,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349864765] [2022-04-27 22:59:02,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:59:02,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411631511] [2022-04-27 22:59:02,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411631511] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:59:02,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:59:02,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 22:59:02,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332083335] [2022-04-27 22:59:02,518 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 22:59:02,518 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 77 [2022-04-27 22:59:02,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:59:02,518 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 22:59:02,551 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 22:59:02,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 22:59:02,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:59:02,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 22:59:02,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 22:59:02,551 INFO L87 Difference]: Start difference. First operand 50 states and 57 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 22:59:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:59:03,214 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-27 22:59:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 22:59:03,215 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 77 [2022-04-27 22:59:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:59:03,215 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 22:59:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 22:59:03,237 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 22:59:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-27 22:59:03,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-27 22:59:03,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:59:03,286 INFO L225 Difference]: With dead ends: 59 [2022-04-27 22:59:03,286 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 22:59:03,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 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 22:59:03,287 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 22:59:03,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 329 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 22:59:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 22:59:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 22:59:03,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:59:03,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 22:59:03,321 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 22:59:03,321 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 22:59:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:59:03,322 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 22:59:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 22:59:03,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:59:03,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:59:03,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 53 states. [2022-04-27 22:59:03,322 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 53 states. [2022-04-27 22:59:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:59:03,324 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 22:59:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 22:59:03,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:59:03,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:59:03,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:59:03,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:59:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 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 22:59:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-04-27 22:59:03,325 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 77 [2022-04-27 22:59:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:59:03,325 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-04-27 22:59:03,325 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 22:59:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 22:59:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 22:59:03,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:59:03,326 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:59:03,337 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 22:59:03,535 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 22:59:03,535 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:59:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:59:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash -43835902, now seen corresponding path program 8 times [2022-04-27 22:59:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:59:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153263303] [2022-04-27 22:59:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:59:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:59:03,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:59:03,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123414463] [2022-04-27 22:59:03,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 22:59:03,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:59:03,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:59:03,546 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 22:59:03,547 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 22:59:35,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 22:59:35,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:59:35,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 22:59:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:59:35,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:59:35,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {3994#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {3994#true} [65] 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] {3994#true} is VALID [2022-04-27 22:59:35,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {3994#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3994#true} {3994#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {3994#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {3994#true} [67] 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_2, main_~x~0=v_main_~x~0_1, 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] {3994#true} is VALID [2022-04-27 22:59:35,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {3994#true} [69] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3994#true} is VALID [2022-04-27 22:59:35,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {3994#true} [71] 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] {3994#true} is VALID [2022-04-27 22:59:35,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {3994#true} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {3994#true} [79] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3994#true} {3994#true} [92] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3994#true} is VALID [2022-04-27 22:59:35,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {3994#true} [70] L21-1-->L27-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~x~0_2 0) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {4032#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:59:35,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {4032#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4032#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:59:35,637 INFO L272 TraceCheckUtils]: 13: Hoare triple {4032#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-->__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] {3994#true} is VALID [2022-04-27 22:59:35,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,637 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3994#true} {4032#(and (= main_~c~0 0) (= main_~y~0 0))} [94] __VERIFIER_assertEXIT-->L28-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] {4032#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 22:59:35,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {4032#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 22:59:35,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 22:59:35,638 INFO L272 TraceCheckUtils]: 20: Hoare triple {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} [78] L28-->__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] {3994#true} is VALID [2022-04-27 22:59:35,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,639 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3994#true} {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} [94] __VERIFIER_assertEXIT-->L28-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] {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-27 22:59:35,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {4054#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,641 INFO L272 TraceCheckUtils]: 27: Hoare triple {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} [78] L28-->__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] {3994#true} is VALID [2022-04-27 22:59:35,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,641 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3994#true} {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-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] {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {4076#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< 0 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 22:59:35,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 22:59:35,642 INFO L272 TraceCheckUtils]: 34: Hoare triple {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [78] L28-->__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] {3994#true} is VALID [2022-04-27 22:59:35,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,644 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3994#true} {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [94] __VERIFIER_assertEXIT-->L28-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] {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 22:59:35,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {4098#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,645 INFO L272 TraceCheckUtils]: 41: Hoare triple {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} [78] L28-->__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] {3994#true} is VALID [2022-04-27 22:59:35,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,646 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3994#true} {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-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] {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {4120#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,646 INFO L272 TraceCheckUtils]: 48: Hoare triple {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} [78] L28-->__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] {3994#true} is VALID [2022-04-27 22:59:35,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,647 INFO L290 TraceCheckUtils]: 51: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,647 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3994#true} {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-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] {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {4142#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,648 INFO L272 TraceCheckUtils]: 55: Hoare triple {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [78] L28-->__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] {3994#true} is VALID [2022-04-27 22:59:35,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,648 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3994#true} {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-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] {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {4164#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,649 INFO L272 TraceCheckUtils]: 62: Hoare triple {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} [78] L28-->__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] {3994#true} is VALID [2022-04-27 22:59:35,649 INFO L290 TraceCheckUtils]: 63: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,649 INFO L290 TraceCheckUtils]: 64: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,650 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3994#true} {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} [94] __VERIFIER_assertEXIT-->L28-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] {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-27 22:59:35,650 INFO L290 TraceCheckUtils]: 67: Hoare triple {4186#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} [83] L28-1-->L27-2: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= (+ v_main_~x~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) v_main_~x~0_4)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 22:59:35,650 INFO L290 TraceCheckUtils]: 68: Hoare triple {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [74] L27-2-->L28: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 22:59:35,650 INFO L272 TraceCheckUtils]: 69: Hoare triple {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [78] L28-->__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] {3994#true} is VALID [2022-04-27 22:59:35,651 INFO L290 TraceCheckUtils]: 70: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,651 INFO L290 TraceCheckUtils]: 71: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,651 INFO L290 TraceCheckUtils]: 72: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,651 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3994#true} {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [94] __VERIFIER_assertEXIT-->L28-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] {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 22:59:35,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {4208#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [82] L28-1-->L27-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {4230#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 22:59:35,652 INFO L272 TraceCheckUtils]: 75: Hoare triple {4230#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [77] L27-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] {3994#true} is VALID [2022-04-27 22:59:35,652 INFO L290 TraceCheckUtils]: 76: Hoare triple {3994#true} [81] __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] {3994#true} is VALID [2022-04-27 22:59:35,652 INFO L290 TraceCheckUtils]: 77: Hoare triple {3994#true} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,652 INFO L290 TraceCheckUtils]: 78: Hoare triple {3994#true} [90] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#true} is VALID [2022-04-27 22:59:35,652 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {3994#true} {4230#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [95] __VERIFIER_assertEXIT-->L38: 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] {4230#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 22:59:35,653 INFO L272 TraceCheckUtils]: 80: Hoare triple {4230#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [80] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:59:35,653 INFO L290 TraceCheckUtils]: 81: Hoare triple {4249#(<= 1 |__VERIFIER_assert_#in~cond|)} [81] __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] {4253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:59:35,653 INFO L290 TraceCheckUtils]: 82: Hoare triple {4253#(<= 1 __VERIFIER_assert_~cond)} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3995#false} is VALID [2022-04-27 22:59:35,653 INFO L290 TraceCheckUtils]: 83: Hoare triple {3995#false} [88] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3995#false} is VALID [2022-04-27 22:59:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 22:59:35,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:59:36,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:59:36,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153263303] [2022-04-27 22:59:36,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:59:36,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123414463] [2022-04-27 22:59:36,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123414463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:59:36,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:59:36,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 22:59:36,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100677717] [2022-04-27 22:59:36,439 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 22:59:36,439 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 84 [2022-04-27 22:59:36,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:59:36,440 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 22:59:36,477 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 22:59:36,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 22:59:36,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:59:36,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 22:59:36,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-04-27 22:59:36,478 INFO L87 Difference]: Start difference. First operand 53 states and 61 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 22:59:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:59:37,341 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-04-27 22:59:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 22:59:37,341 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 84 [2022-04-27 22:59:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:59:37,342 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 22:59:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-27 22:59:37,343 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 22:59:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-27 22:59:37,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 68 transitions. [2022-04-27 22:59:37,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:59:37,392 INFO L225 Difference]: With dead ends: 62 [2022-04-27 22:59:37,393 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 22:59:37,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2022-04-27 22:59:37,393 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 22:59:37,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 22:59:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 22:59:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 22:59:37,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:59:37,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 22:59:37,422 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 22:59:37,422 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 22:59:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:59:37,423 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-04-27 22:59:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-04-27 22:59:37,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:59:37,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:59:37,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 56 states. [2022-04-27 22:59:37,424 INFO L87 Difference]: Start difference. First operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 56 states. [2022-04-27 22:59:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:59:37,425 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-04-27 22:59:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-04-27 22:59:37,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:59:37,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:59:37,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:59:37,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:59:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 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 22:59:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-04-27 22:59:37,426 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 84 [2022-04-27 22:59:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:59:37,427 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-04-27 22:59:37,427 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 22:59:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-04-27 22:59:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 22:59:37,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:59:37,427 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:59:37,438 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 22:59:37,638 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 22:59:37,638 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:59:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:59:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1217798896, now seen corresponding path program 9 times [2022-04-27 22:59:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:59:37,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232300728] [2022-04-27 22:59:37,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:59:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:59:37,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:59:37,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1374794414] [2022-04-27 22:59:37,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 22:59:37,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:59:37,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:59:37,650 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 22:59:37,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process