/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 20:15:47,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 20:15:47,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 20:15:47,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 20:15:47,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 20:15:47,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 20:15:47,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 20:15:47,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 20:15:47,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 20:15:47,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 20:15:47,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 20:15:47,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 20:15:47,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 20:15:47,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 20:15:47,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 20:15:47,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 20:15:47,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 20:15:47,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 20:15:47,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 20:15:47,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 20:15:47,461 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 20:15:47,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 20:15:47,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 20:15:47,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 20:15:47,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 20:15:47,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 20:15:47,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 20:15:47,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 20:15:47,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 20:15:47,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 20:15:47,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 20:15:47,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 20:15:47,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 20:15:47,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 20:15:47,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 20:15:47,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 20:15:47,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 20:15:47,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 20:15:47,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 20:15:47,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 20:15:47,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 20:15:47,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 20:15:47,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 20:15:47,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 20:15:47,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 20:15:47,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 20:15:47,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 20:15:47,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 20:15:47,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 20:15:47,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 20:15:47,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 20:15:47,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 20:15:47,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 20:15:47,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 20:15:47,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 20:15:47,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 20:15:47,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 20:15:47,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 20:15:47,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 20:15:47,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 20:15:47,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 20:15:47,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:15:47,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 20:15:47,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 20:15:47,490 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 20:15:47,490 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 20:15:47,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 20:15:47,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 20:15:47,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 20:15:47,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 20:15:47,698 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 20:15:47,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c [2022-04-27 20:15:47,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708254bd9/5531c45bfa4847c7a1e9fad0cca5b74f/FLAG9dd0c4caa [2022-04-27 20:15:48,076 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 20:15:48,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c [2022-04-27 20:15:48,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708254bd9/5531c45bfa4847c7a1e9fad0cca5b74f/FLAG9dd0c4caa [2022-04-27 20:15:48,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708254bd9/5531c45bfa4847c7a1e9fad0cca5b74f [2022-04-27 20:15:48,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 20:15:48,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 20:15:48,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 20:15:48,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 20:15:48,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 20:15:48,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d367762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48, skipping insertion in model container [2022-04-27 20:15:48,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 20:15:48,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 20:15:48,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c[458,471] [2022-04-27 20:15:48,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:15:48,683 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 20:15:48,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c[458,471] [2022-04-27 20:15:48,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 20:15:48,714 INFO L208 MainTranslator]: Completed translation [2022-04-27 20:15:48,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48 WrapperNode [2022-04-27 20:15:48,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 20:15:48,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 20:15:48,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 20:15:48,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 20:15:48,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 20:15:48,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 20:15:48,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 20:15:48,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 20:15:48,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 20:15:48,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:48,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 20:15:48,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 20:15:48,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 20:15:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 20:15:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 20:15:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 20:15:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 20:15:48,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 20:15:48,797 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 20:15:48,797 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 20:15:48,797 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 20:15:48,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 20:15:48,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 20:15:48,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 20:15:48,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 20:15:48,798 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 20:15:48,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 20:15:48,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 20:15:48,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 20:15:48,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 20:15:48,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 20:15:48,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 20:15:48,836 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 20:15:48,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 20:15:48,932 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 20:15:48,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 20:15:48,937 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 20:15:48,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:15:48 BoogieIcfgContainer [2022-04-27 20:15:48,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 20:15:48,939 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 20:15:48,939 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 20:15:48,940 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 20:15:48,941 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:15:48" (1/1) ... [2022-04-27 20:15:48,943 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 20:15:48,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:15:48 BasicIcfg [2022-04-27 20:15:48,960 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 20:15:48,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 20:15:48,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 20:15:48,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 20:15:48,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 08:15:48" (1/4) ... [2022-04-27 20:15:48,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80162f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:15:48, skipping insertion in model container [2022-04-27 20:15:48,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 08:15:48" (2/4) ... [2022-04-27 20:15:48,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80162f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 08:15:48, skipping insertion in model container [2022-04-27 20:15:48,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 08:15:48" (3/4) ... [2022-04-27 20:15:48,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80162f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:15:48, skipping insertion in model container [2022-04-27 20:15:48,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 08:15:48" (4/4) ... [2022-04-27 20:15:48,965 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound5.cJordan [2022-04-27 20:15:48,974 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 20:15:48,974 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 20:15:48,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 20:15:49,003 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6011bbb8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@45b462b9 [2022-04-27 20:15:49,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 20:15:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 20:15:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 20:15:49,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:49,013 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 20:15:49,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash 843387237, now seen corresponding path program 1 times [2022-04-27 20:15:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:49,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034820435] [2022-04-27 20:15:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:49,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 20:15:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:49,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 20:15:49,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:15:49,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:15:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 20:15:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:49,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-27 20:15:49,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [75] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:15:49,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:15:49,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-27 20:15:49,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 20:15:49,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 20:15:49,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:15:49,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:15:49,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 20:15:49,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {32#true} is VALID [2022-04-27 20:15:49,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-27 20:15:49,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-27 20:15:49,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [75] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:15:49,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:15:49,163 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-27 20:15:49,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {33#false} is VALID [2022-04-27 20:15:49,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} [73] L28-3-->L28-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:15:49,163 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {33#false} is VALID [2022-04-27 20:15:49,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID [2022-04-27 20:15:49,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} [85] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:15:49,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 20:15:49,164 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 20:15:49,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:49,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034820435] [2022-04-27 20:15:49,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034820435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:15:49,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:15:49,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 20:15:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750868432] [2022-04-27 20:15:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:15:49,170 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 20:15:49,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:49,173 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 20:15:49,189 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 20:15:49,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 20:15:49,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:49,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 20:15:49,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 20:15:49,205 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:15:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:49,391 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 20:15:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 20:15:49,392 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 20:15:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:49,393 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 20:15:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 20:15:49,403 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 20:15:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 20:15:49,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 20:15:49,438 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 20:15:49,444 INFO L225 Difference]: With dead ends: 30 [2022-04-27 20:15:49,445 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 20:15:49,446 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 20:15:49,448 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:49,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:15:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 20:15:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-27 20:15:49,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:49,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:15:49,467 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:15:49,468 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:15:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:49,471 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 20:15:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 20:15:49,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:49,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:49,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 20:15:49,472 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 20:15:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:49,474 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 20:15:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 20:15:49,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:49,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:49,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:49,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:15:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 20:15:49,478 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-27 20:15:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:49,478 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 20:15:49,478 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 20:15:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 20:15:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 20:15:49,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:49,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:49,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 20:15:49,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash 208087835, now seen corresponding path program 1 times [2022-04-27 20:15:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:49,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866835190] [2022-04-27 20:15:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:49,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:49,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:49,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819533030] [2022-04-27 20:15:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:49,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:49,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:49,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:49,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 20:15:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:49,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 20:15:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:49,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:15:49,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {148#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-27 20:15:49,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#(<= ~counter~0 0)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#(<= ~counter~0 0)} {148#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#(<= ~counter~0 0)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#(<= ~counter~0 0)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {156#(<= ~counter~0 0)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {156#(<= ~counter~0 0)} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {156#(<= ~counter~0 0)} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(<= ~counter~0 0)} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,725 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {156#(<= ~counter~0 0)} {156#(<= ~counter~0 0)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#(<= ~counter~0 0)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {156#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:49,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {156#(<= ~counter~0 0)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {190#(<= |main_#t~post5| 0)} is VALID [2022-04-27 20:15:49,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {190#(<= |main_#t~post5| 0)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {149#false} is VALID [2022-04-27 20:15:49,727 INFO L272 TraceCheckUtils]: 14: Hoare triple {149#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {149#false} is VALID [2022-04-27 20:15:49,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {149#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {149#false} is VALID [2022-04-27 20:15:49,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {149#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[] {149#false} is VALID [2022-04-27 20:15:49,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {149#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#false} is VALID [2022-04-27 20:15:49,727 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 20:15:49,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 20:15:49,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:49,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866835190] [2022-04-27 20:15:49,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:15:49,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819533030] [2022-04-27 20:15:49,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819533030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:15:49,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:15:49,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 20:15:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782796112] [2022-04-27 20:15:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:15:49,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 20:15:49,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:49,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 20:15:49,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:49,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 20:15:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 20:15:49,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:15:49,745 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 20:15:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:49,848 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 20:15:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 20:15:49,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 20:15:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 20:15:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-27 20:15:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 20:15:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-27 20:15:49,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-27 20:15:49,875 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 20:15:49,876 INFO L225 Difference]: With dead ends: 26 [2022-04-27 20:15:49,876 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 20:15:49,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 20:15:49,878 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:49,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:15:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 20:15:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 20:15:49,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:49,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:15:49,881 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:15:49,881 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:15:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:49,883 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 20:15:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 20:15:49,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:49,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:49,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 20:15:49,884 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 20:15:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:49,886 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 20:15:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 20:15:49,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:49,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:49,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:49,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 20:15:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 20:15:49,888 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-27 20:15:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:49,888 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 20:15:49,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 20:15:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 20:15:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 20:15:49,889 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:49,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:49,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 20:15:50,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:50,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash 209190102, now seen corresponding path program 1 times [2022-04-27 20:15:50,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:50,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115327580] [2022-04-27 20:15:50,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:50,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:50,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:50,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204638245] [2022-04-27 20:15:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:50,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:50,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:50,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 20:15:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:50,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 20:15:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:50,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:15:50,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 20:15:50,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {309#true} is VALID [2022-04-27 20:15:50,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 20:15:50,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 20:15:50,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 20:15:50,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {309#true} is VALID [2022-04-27 20:15:50,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {309#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-27 20:15:50,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {309#true} is VALID [2022-04-27 20:15:50,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#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[] {309#true} is VALID [2022-04-27 20:15:50,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {309#true} is VALID [2022-04-27 20:15:50,316 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {309#true} {309#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {309#true} is VALID [2022-04-27 20:15:50,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {309#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {347#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:50,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {347#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {347#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:50,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(and (= main_~x~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {347#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:50,319 INFO L272 TraceCheckUtils]: 14: Hoare triple {347#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {357#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:15:50,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {357#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {361#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:15:50,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {361#(<= 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[] {310#false} is VALID [2022-04-27 20:15:50,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {310#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {310#false} is VALID [2022-04-27 20:15:50,320 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 20:15:50,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 20:15:50,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:50,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115327580] [2022-04-27 20:15:50,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:15:50,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204638245] [2022-04-27 20:15:50,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204638245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 20:15:50,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 20:15:50,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 20:15:50,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63882850] [2022-04-27 20:15:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:15:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 20:15:50,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:50,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:15:50,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:50,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 20:15:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 20:15:50,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 20:15:50,335 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:15:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:50,464 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 20:15:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 20:15:50,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 20:15:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:15:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 20:15:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:15:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 20:15:50,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 20:15:50,502 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 20:15:50,504 INFO L225 Difference]: With dead ends: 34 [2022-04-27 20:15:50,504 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 20:15:50,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 20:15:50,507 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:50,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:15:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 20:15:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 20:15:50,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:50,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:15:50,513 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:15:50,513 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:15:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:50,516 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 20:15:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 20:15:50,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:50,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:50,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 20:15:50,522 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 20:15:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:50,525 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 20:15:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 20:15:50,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:50,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:50,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:50,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 20:15:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 20:15:50,529 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-27 20:15:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:50,529 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 20:15:50,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 20:15:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 20:15:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 20:15:50,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:50,530 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:50,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 20:15:50,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 20:15:50,744 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1223799235, now seen corresponding path program 1 times [2022-04-27 20:15:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:50,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698481834] [2022-04-27 20:15:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:50,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:50,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1977209915] [2022-04-27 20:15:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:50,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:50,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:50,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:50,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 20:15:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:50,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 20:15:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:50,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:15:50,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {499#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 20:15:50,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#(<= ~counter~0 0)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#(<= ~counter~0 0)} {499#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#(<= ~counter~0 0)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#(<= ~counter~0 0)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#(<= ~counter~0 0)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= ~counter~0 0)} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#(<= ~counter~0 0)} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#(<= ~counter~0 0)} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#(<= ~counter~0 0)} {507#(<= ~counter~0 0)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#(<= ~counter~0 0)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {507#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:50,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#(<= ~counter~0 0)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {541#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:50,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#(<= ~counter~0 1)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {541#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:50,984 INFO L272 TraceCheckUtils]: 14: Hoare triple {541#(<= ~counter~0 1)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {541#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:50,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {541#(<= ~counter~0 1)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {541#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:50,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {541#(<= ~counter~0 1)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {541#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:50,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {541#(<= ~counter~0 1)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {541#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:50,988 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {541#(<= ~counter~0 1)} {541#(<= ~counter~0 1)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {541#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:50,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {541#(<= ~counter~0 1)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {541#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:50,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {541#(<= ~counter~0 1)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {566#(<= |main_#t~post5| 1)} is VALID [2022-04-27 20:15:50,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {566#(<= |main_#t~post5| 1)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {500#false} is VALID [2022-04-27 20:15:50,991 INFO L272 TraceCheckUtils]: 22: Hoare triple {500#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {500#false} is VALID [2022-04-27 20:15:50,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {500#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {500#false} is VALID [2022-04-27 20:15:50,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {500#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[] {500#false} is VALID [2022-04-27 20:15:50,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {500#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {500#false} is VALID [2022-04-27 20:15:50,992 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 20:15:50,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:15:51,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {500#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {500#false} is VALID [2022-04-27 20:15:51,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {500#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[] {500#false} is VALID [2022-04-27 20:15:51,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {500#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {500#false} is VALID [2022-04-27 20:15:51,169 INFO L272 TraceCheckUtils]: 22: Hoare triple {500#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {500#false} is VALID [2022-04-27 20:15:51,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {594#(< |main_#t~post5| 5)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {500#false} is VALID [2022-04-27 20:15:51,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {598#(< ~counter~0 5)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {594#(< |main_#t~post5| 5)} is VALID [2022-04-27 20:15:51,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(< ~counter~0 5)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {598#(< ~counter~0 5)} is VALID [2022-04-27 20:15:51,171 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {499#true} {598#(< ~counter~0 5)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {598#(< ~counter~0 5)} is VALID [2022-04-27 20:15:51,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {499#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 20:15:51,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {499#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[] {499#true} is VALID [2022-04-27 20:15:51,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {499#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {499#true} is VALID [2022-04-27 20:15:51,171 INFO L272 TraceCheckUtils]: 14: Hoare triple {598#(< ~counter~0 5)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {499#true} is VALID [2022-04-27 20:15:51,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {598#(< ~counter~0 5)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {598#(< ~counter~0 5)} is VALID [2022-04-27 20:15:51,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#(< ~counter~0 4)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {598#(< ~counter~0 5)} is VALID [2022-04-27 20:15:51,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#(< ~counter~0 4)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {623#(< ~counter~0 4)} is VALID [2022-04-27 20:15:51,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {499#true} {623#(< ~counter~0 4)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {623#(< ~counter~0 4)} is VALID [2022-04-27 20:15:51,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {499#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 20:15:51,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {499#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[] {499#true} is VALID [2022-04-27 20:15:51,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {499#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {499#true} is VALID [2022-04-27 20:15:51,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#(< ~counter~0 4)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {499#true} is VALID [2022-04-27 20:15:51,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#(< ~counter~0 4)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {623#(< ~counter~0 4)} is VALID [2022-04-27 20:15:51,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#(< ~counter~0 4)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {623#(< ~counter~0 4)} is VALID [2022-04-27 20:15:51,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#(< ~counter~0 4)} {499#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {623#(< ~counter~0 4)} is VALID [2022-04-27 20:15:51,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#(< ~counter~0 4)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {623#(< ~counter~0 4)} is VALID [2022-04-27 20:15:51,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {623#(< ~counter~0 4)} is VALID [2022-04-27 20:15:51,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {499#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#true} is VALID [2022-04-27 20:15:51,176 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 20:15:51,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:51,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698481834] [2022-04-27 20:15:51,177 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:15:51,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977209915] [2022-04-27 20:15:51,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977209915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 20:15:51,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 20:15:51,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 20:15:51,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805856080] [2022-04-27 20:15:51,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 20:15:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 20:15:51,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:51,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:51,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:51,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 20:15:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:51,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 20:15:51,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 20:15:51,210 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:51,376 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 20:15:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 20:15:51,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 20:15:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-04-27 20:15:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-04-27 20:15:51,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2022-04-27 20:15:51,430 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 20:15:51,431 INFO L225 Difference]: With dead ends: 58 [2022-04-27 20:15:51,431 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 20:15:51,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 20:15:51,432 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 38 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:51,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 127 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:15:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 20:15:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-04-27 20:15:51,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:51,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:51,436 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:51,436 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:51,438 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 20:15:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 20:15:51,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:51,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:51,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 20:15:51,440 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 20:15:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:51,441 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 20:15:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 20:15:51,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:51,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:51,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:51,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 20:15:51,444 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 26 [2022-04-27 20:15:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:51,444 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 20:15:51,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 20:15:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 20:15:51,445 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:51,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:51,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 20:15:51,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:51,660 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:51,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1222696968, now seen corresponding path program 1 times [2022-04-27 20:15:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:51,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807689360] [2022-04-27 20:15:51,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:51,680 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:51,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585478506] [2022-04-27 20:15:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:51,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:51,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:51,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 20:15:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:51,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 20:15:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:51,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:15:51,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {896#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:51,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {896#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {896#true} is VALID [2022-04-27 20:15:51,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {896#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:51,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {896#true} {896#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:51,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {896#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:51,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {896#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {896#true} is VALID [2022-04-27 20:15:51,854 INFO L272 TraceCheckUtils]: 6: Hoare triple {896#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {896#true} is VALID [2022-04-27 20:15:51,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {896#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {896#true} is VALID [2022-04-27 20:15:51,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {896#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[] {896#true} is VALID [2022-04-27 20:15:51,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {896#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:51,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {896#true} {896#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {896#true} is VALID [2022-04-27 20:15:51,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {896#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {934#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:51,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {934#(and (= main_~x~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {934#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:51,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {934#(and (= main_~x~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {934#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:51,858 INFO L272 TraceCheckUtils]: 14: Hoare triple {934#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {896#true} is VALID [2022-04-27 20:15:51,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {896#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {896#true} is VALID [2022-04-27 20:15:51,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {896#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[] {896#true} is VALID [2022-04-27 20:15:51,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {896#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:51,859 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {896#true} {934#(and (= main_~x~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {934#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:51,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#(and (= main_~x~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {959#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 20:15:51,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {959#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 20:15:51,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {959#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {959#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 20:15:51,861 INFO L272 TraceCheckUtils]: 22: Hoare triple {959#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {969#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:15:51,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {969#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {973#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:15:51,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {973#(<= 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[] {897#false} is VALID [2022-04-27 20:15:51,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {897#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#false} is VALID [2022-04-27 20:15:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 20:15:51,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:15:51,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {897#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#false} is VALID [2022-04-27 20:15:51,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {973#(<= 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[] {897#false} is VALID [2022-04-27 20:15:51,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {969#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {973#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:15:51,980 INFO L272 TraceCheckUtils]: 22: Hoare triple {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {969#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:15:51,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 20:15:51,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 20:15:52,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 20:15:52,061 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {896#true} {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 20:15:52,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {896#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:52,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {896#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[] {896#true} is VALID [2022-04-27 20:15:52,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {896#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {896#true} is VALID [2022-04-27 20:15:52,061 INFO L272 TraceCheckUtils]: 14: Hoare triple {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {896#true} is VALID [2022-04-27 20:15:52,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 20:15:52,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 20:15:52,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {896#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {989#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 20:15:52,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {896#true} {896#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {896#true} is VALID [2022-04-27 20:15:52,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {896#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:52,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {896#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[] {896#true} is VALID [2022-04-27 20:15:52,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {896#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {896#true} is VALID [2022-04-27 20:15:52,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {896#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {896#true} is VALID [2022-04-27 20:15:52,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {896#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {896#true} is VALID [2022-04-27 20:15:52,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {896#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:52,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {896#true} {896#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:52,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {896#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:52,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {896#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {896#true} is VALID [2022-04-27 20:15:52,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {896#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {896#true} is VALID [2022-04-27 20:15:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 20:15:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:52,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807689360] [2022-04-27 20:15:52,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:15:52,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585478506] [2022-04-27 20:15:52,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585478506] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 20:15:52,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:15:52,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 20:15:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745048748] [2022-04-27 20:15:52,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 20:15:52,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 20:15:52,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:52,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:15:52,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:52,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 20:15:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 20:15:52,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 20:15:52,140 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:15:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:52,232 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-04-27 20:15:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 20:15:52,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 20:15:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:15:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 20:15:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:15:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 20:15:52,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-27 20:15:52,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:52,302 INFO L225 Difference]: With dead ends: 66 [2022-04-27 20:15:52,302 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 20:15:52,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 20:15:52,303 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:52,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:15:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 20:15:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-27 20:15:52,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:52,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:52,307 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:52,307 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:52,309 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 20:15:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 20:15:52,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:52,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:52,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 20:15:52,310 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 20:15:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:52,311 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 20:15:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 20:15:52,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:52,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:52,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:52,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-27 20:15:52,313 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 26 [2022-04-27 20:15:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:52,313 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-27 20:15:52,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 20:15:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-27 20:15:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 20:15:52,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:52,314 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:52,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 20:15:52,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:52,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:52,519 INFO L85 PathProgramCache]: Analyzing trace with hash 96926796, now seen corresponding path program 1 times [2022-04-27 20:15:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:52,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603795815] [2022-04-27 20:15:52,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:52,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:52,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:52,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119293897] [2022-04-27 20:15:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:52,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:52,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:52,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:52,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 20:15:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:52,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 20:15:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:52,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:15:52,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {1300#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1300#true} is VALID [2022-04-27 20:15:52,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {1300#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1300#true} is VALID [2022-04-27 20:15:52,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {1300#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1300#true} is VALID [2022-04-27 20:15:52,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1300#true} {1300#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1300#true} is VALID [2022-04-27 20:15:52,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {1300#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1300#true} is VALID [2022-04-27 20:15:52,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {1300#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1300#true} is VALID [2022-04-27 20:15:52,888 INFO L272 TraceCheckUtils]: 6: Hoare triple {1300#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1300#true} is VALID [2022-04-27 20:15:52,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1300#true} is VALID [2022-04-27 20:15:52,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {1300#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[] {1300#true} is VALID [2022-04-27 20:15:52,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {1300#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1300#true} is VALID [2022-04-27 20:15:52,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1300#true} {1300#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1300#true} is VALID [2022-04-27 20:15:52,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {1300#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1338#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:52,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {1338#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1338#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:52,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {1338#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1338#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:52,890 INFO L272 TraceCheckUtils]: 14: Hoare triple {1338#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1300#true} is VALID [2022-04-27 20:15:52,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {1300#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1300#true} is VALID [2022-04-27 20:15:52,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {1300#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[] {1300#true} is VALID [2022-04-27 20:15:52,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {1300#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1300#true} is VALID [2022-04-27 20:15:52,892 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1300#true} {1338#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1338#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:52,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {1338#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1363#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:15:52,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {1363#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1363#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:15:52,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {1363#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1363#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:15:52,896 INFO L272 TraceCheckUtils]: 22: Hoare triple {1363#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1300#true} is VALID [2022-04-27 20:15:52,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {1300#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1300#true} is VALID [2022-04-27 20:15:52,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#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[] {1300#true} is VALID [2022-04-27 20:15:52,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1300#true} is VALID [2022-04-27 20:15:52,897 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1300#true} {1363#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1363#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 20:15:52,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {1363#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {1388#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 20:15:52,898 INFO L272 TraceCheckUtils]: 28: Hoare triple {1388#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {1300#true} is VALID [2022-04-27 20:15:52,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {1300#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1300#true} is VALID [2022-04-27 20:15:52,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {1300#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[] {1300#true} is VALID [2022-04-27 20:15:52,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {1300#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1300#true} is VALID [2022-04-27 20:15:52,899 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1300#true} {1388#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {1388#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 20:15:52,900 INFO L272 TraceCheckUtils]: 33: Hoare triple {1388#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1407#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:15:52,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {1407#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1411#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:15:52,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {1411#(<= 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[] {1301#false} is VALID [2022-04-27 20:15:52,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {1301#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1301#false} is VALID [2022-04-27 20:15:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 20:15:52,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:15:53,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:53,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603795815] [2022-04-27 20:15:53,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:15:53,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119293897] [2022-04-27 20:15:53,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119293897] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:15:53,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:15:53,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 20:15:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313984538] [2022-04-27 20:15:53,212 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:15:53,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 20:15:53,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:53,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 20:15:53,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:53,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 20:15:53,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:53,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 20:15:53,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 20:15:53,234 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 20:15:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:53,390 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-27 20:15:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 20:15:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 20:15:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 20:15:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-27 20:15:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 20:15:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-27 20:15:53,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-27 20:15:53,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:53,420 INFO L225 Difference]: With dead ends: 57 [2022-04-27 20:15:53,420 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 20:15:53,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 20:15:53,421 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:53,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:15:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 20:15:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 20:15:53,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:53,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:53,424 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:53,425 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:53,426 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 20:15:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 20:15:53,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:53,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:53,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 20:15:53,426 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 20:15:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:53,428 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 20:15:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 20:15:53,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:53,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:53,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:53,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-27 20:15:53,432 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 37 [2022-04-27 20:15:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:53,432 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-27 20:15:53,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 20:15:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 20:15:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 20:15:53,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:53,433 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:53,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 20:15:53,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:53,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash -678596118, now seen corresponding path program 2 times [2022-04-27 20:15:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:53,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826434014] [2022-04-27 20:15:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:53,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:53,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435590452] [2022-04-27 20:15:53,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 20:15:53,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:53,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:53,676 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:53,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 20:15:53,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 20:15:53,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:15:53,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 20:15:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:53,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:15:54,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {1697#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#true} is VALID [2022-04-27 20:15:54,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1697#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1697#true} is VALID [2022-04-27 20:15:54,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {1697#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#true} is VALID [2022-04-27 20:15:54,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1697#true} {1697#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#true} is VALID [2022-04-27 20:15:54,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {1697#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#true} is VALID [2022-04-27 20:15:54,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {1697#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1697#true} is VALID [2022-04-27 20:15:54,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {1697#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1697#true} is VALID [2022-04-27 20:15:54,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {1697#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1697#true} is VALID [2022-04-27 20:15:54,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {1697#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[] {1697#true} is VALID [2022-04-27 20:15:54,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {1697#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#true} is VALID [2022-04-27 20:15:54,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1697#true} {1697#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1697#true} is VALID [2022-04-27 20:15:54,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {1697#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1735#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:54,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {1735#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1735#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:54,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {1735#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1735#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:54,101 INFO L272 TraceCheckUtils]: 14: Hoare triple {1735#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1697#true} is VALID [2022-04-27 20:15:54,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {1697#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1697#true} is VALID [2022-04-27 20:15:54,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {1697#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[] {1697#true} is VALID [2022-04-27 20:15:54,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {1697#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#true} is VALID [2022-04-27 20:15:54,102 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1697#true} {1735#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1735#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:54,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {1735#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1760#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:15:54,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {1760#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1760#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:15:54,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {1760#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1760#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:15:54,103 INFO L272 TraceCheckUtils]: 22: Hoare triple {1760#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1697#true} is VALID [2022-04-27 20:15:54,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {1697#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1697#true} is VALID [2022-04-27 20:15:54,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {1697#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[] {1697#true} is VALID [2022-04-27 20:15:54,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {1697#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#true} is VALID [2022-04-27 20:15:54,104 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1697#true} {1760#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1760#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:15:54,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {1760#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1785#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 20:15:54,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {1785#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1785#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 20:15:54,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {1785#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1785#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 20:15:54,106 INFO L272 TraceCheckUtils]: 30: Hoare triple {1785#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1697#true} is VALID [2022-04-27 20:15:54,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {1697#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1697#true} is VALID [2022-04-27 20:15:54,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {1697#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[] {1697#true} is VALID [2022-04-27 20:15:54,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {1697#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#true} is VALID [2022-04-27 20:15:54,107 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1697#true} {1785#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1785#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 20:15:54,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {1785#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {1810#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 20:15:54,108 INFO L272 TraceCheckUtils]: 36: Hoare triple {1810#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {1697#true} is VALID [2022-04-27 20:15:54,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {1697#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1697#true} is VALID [2022-04-27 20:15:54,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {1697#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[] {1697#true} is VALID [2022-04-27 20:15:54,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {1697#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1697#true} is VALID [2022-04-27 20:15:54,109 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1697#true} {1810#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {1810#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 20:15:54,109 INFO L272 TraceCheckUtils]: 41: Hoare triple {1810#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:15:54,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {1829#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:15:54,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {1833#(<= 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[] {1698#false} is VALID [2022-04-27 20:15:54,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {1698#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1698#false} is VALID [2022-04-27 20:15:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 20:15:54,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:15:54,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:54,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826434014] [2022-04-27 20:15:54,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:15:54,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435590452] [2022-04-27 20:15:54,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435590452] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:15:54,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:15:54,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 20:15:54,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221935518] [2022-04-27 20:15:54,381 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:15:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 20:15:54,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:54,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:54,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:54,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 20:15:54,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:54,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 20:15:54,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 20:15:54,406 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:54,669 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-27 20:15:54,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 20:15:54,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 20:15:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-27 20:15:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-27 20:15:54,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-27 20:15:54,712 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 20:15:54,713 INFO L225 Difference]: With dead ends: 56 [2022-04-27 20:15:54,713 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 20:15:54,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 20:15:54,714 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:54,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:15:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 20:15:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 20:15:54,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:54,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:15:54,718 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:15:54,718 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:15:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:54,719 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 20:15:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 20:15:54,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:54,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:54,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 20:15:54,720 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 20:15:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:54,722 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 20:15:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 20:15:54,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:54,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:54,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:54,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 20:15:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-27 20:15:54,724 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2022-04-27 20:15:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:54,724 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-27 20:15:54,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 20:15:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 20:15:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 20:15:54,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:54,725 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:54,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 20:15:54,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:54,930 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1280010632, now seen corresponding path program 3 times [2022-04-27 20:15:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:54,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501614222] [2022-04-27 20:15:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:54,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144035704] [2022-04-27 20:15:54,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 20:15:54,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:54,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:54,944 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:54,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 20:15:55,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 20:15:55,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:15:55,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 20:15:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:55,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:15:55,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {2115#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {2115#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2115#true} is VALID [2022-04-27 20:15:55,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {2115#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2115#true} {2115#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {2115#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {2115#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2115#true} is VALID [2022-04-27 20:15:55,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {2115#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2115#true} is VALID [2022-04-27 20:15:55,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {2115#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2115#true} is VALID [2022-04-27 20:15:55,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {2115#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[] {2115#true} is VALID [2022-04-27 20:15:55,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {2115#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2115#true} {2115#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2115#true} is VALID [2022-04-27 20:15:55,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {2115#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:55,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {2153#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:55,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {2153#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:55,609 INFO L272 TraceCheckUtils]: 14: Hoare triple {2153#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2115#true} is VALID [2022-04-27 20:15:55,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {2115#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2115#true} is VALID [2022-04-27 20:15:55,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {2115#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[] {2115#true} is VALID [2022-04-27 20:15:55,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {2115#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,611 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2115#true} {2153#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:55,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {2153#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2178#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:15:55,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {2178#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2178#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:15:55,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {2178#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2178#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:15:55,612 INFO L272 TraceCheckUtils]: 22: Hoare triple {2178#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2115#true} is VALID [2022-04-27 20:15:55,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {2115#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2115#true} is VALID [2022-04-27 20:15:55,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {2115#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[] {2115#true} is VALID [2022-04-27 20:15:55,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {2115#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,613 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2115#true} {2178#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2178#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 20:15:55,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {2178#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2203#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:15:55,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {2203#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2203#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:15:55,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {2203#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2203#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:15:55,614 INFO L272 TraceCheckUtils]: 30: Hoare triple {2203#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2115#true} is VALID [2022-04-27 20:15:55,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {2115#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2115#true} is VALID [2022-04-27 20:15:55,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {2115#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[] {2115#true} is VALID [2022-04-27 20:15:55,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {2115#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,614 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2115#true} {2203#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2203#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 20:15:55,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {2203#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2228#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:15:55,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {2228#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2228#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:15:55,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {2228#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2228#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:15:55,616 INFO L272 TraceCheckUtils]: 38: Hoare triple {2228#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2115#true} is VALID [2022-04-27 20:15:55,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {2115#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2115#true} is VALID [2022-04-27 20:15:55,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {2115#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[] {2115#true} is VALID [2022-04-27 20:15:55,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {2115#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,616 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2115#true} {2228#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2228#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:15:55,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {2228#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {2253#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:15:55,617 INFO L272 TraceCheckUtils]: 44: Hoare triple {2253#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {2115#true} is VALID [2022-04-27 20:15:55,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {2115#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2115#true} is VALID [2022-04-27 20:15:55,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {2115#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[] {2115#true} is VALID [2022-04-27 20:15:55,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {2115#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#true} is VALID [2022-04-27 20:15:55,618 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2115#true} {2253#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {2253#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 20:15:55,618 INFO L272 TraceCheckUtils]: 49: Hoare triple {2253#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2272#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:15:55,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {2272#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2276#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:15:55,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {2276#(<= 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[] {2116#false} is VALID [2022-04-27 20:15:55,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {2116#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2116#false} is VALID [2022-04-27 20:15:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 20:15:55,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:15:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501614222] [2022-04-27 20:15:55,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:15:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144035704] [2022-04-27 20:15:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144035704] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:15:55,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:15:55,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 20:15:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346424447] [2022-04-27 20:15:55,876 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:15:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 20:15:55,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:55,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 20:15:55,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:55,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 20:15:55,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 20:15:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 20:15:55,907 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 20:15:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:56,206 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-27 20:15:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 20:15:56,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 20:15:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 20:15:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-27 20:15:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 20:15:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-27 20:15:56,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2022-04-27 20:15:56,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:56,249 INFO L225 Difference]: With dead ends: 58 [2022-04-27 20:15:56,249 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 20:15:56,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 20:15:56,249 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:56,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 20:15:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 20:15:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 20:15:56,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:56,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:56,252 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:56,252 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:56,253 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-27 20:15:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 20:15:56,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:56,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:56,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-27 20:15:56,254 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-27 20:15:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:56,255 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-27 20:15:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 20:15:56,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:56,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:56,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:56,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-27 20:15:56,257 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-27 20:15:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:56,257 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-27 20:15:56,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 20:15:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 20:15:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 20:15:56,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:56,258 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:56,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 20:15:56,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:56,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:56,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1735624483, now seen corresponding path program 1 times [2022-04-27 20:15:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:56,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680454552] [2022-04-27 20:15:56,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:56,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:56,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:56,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909921393] [2022-04-27 20:15:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:56,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:56,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 20:15:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:56,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 20:15:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:56,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:15:56,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {2566#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2566#true} is VALID [2022-04-27 20:15:56,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {2566#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#(<= ~counter~0 0)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#(<= ~counter~0 0)} {2566#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#(<= ~counter~0 0)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#(<= ~counter~0 0)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {2574#(<= ~counter~0 0)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#(<= ~counter~0 0)} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {2574#(<= ~counter~0 0)} [76] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {2574#(<= ~counter~0 0)} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,731 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2574#(<= ~counter~0 0)} {2574#(<= ~counter~0 0)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {2574#(<= ~counter~0 0)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {2574#(<= ~counter~0 0)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#(<= ~counter~0 1)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,733 INFO L272 TraceCheckUtils]: 14: Hoare triple {2608#(<= ~counter~0 1)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {2608#(<= ~counter~0 1)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {2608#(<= ~counter~0 1)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {2608#(<= ~counter~0 1)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,734 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2608#(<= ~counter~0 1)} {2608#(<= ~counter~0 1)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {2608#(<= ~counter~0 1)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {2608#(<= ~counter~0 1)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {2633#(<= ~counter~0 2)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,735 INFO L272 TraceCheckUtils]: 22: Hoare triple {2633#(<= ~counter~0 2)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {2633#(<= ~counter~0 2)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {2633#(<= ~counter~0 2)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {2633#(<= ~counter~0 2)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,737 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2633#(<= ~counter~0 2)} {2633#(<= ~counter~0 2)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {2633#(<= ~counter~0 2)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {2633#(<= ~counter~0 2)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {2658#(<= ~counter~0 3)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,739 INFO L272 TraceCheckUtils]: 30: Hoare triple {2658#(<= ~counter~0 3)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {2658#(<= ~counter~0 3)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {2658#(<= ~counter~0 3)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {2658#(<= ~counter~0 3)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,740 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2658#(<= ~counter~0 3)} {2658#(<= ~counter~0 3)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {2658#(<= ~counter~0 3)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {2658#(<= ~counter~0 3)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {2683#(<= ~counter~0 4)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,744 INFO L272 TraceCheckUtils]: 38: Hoare triple {2683#(<= ~counter~0 4)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {2683#(<= ~counter~0 4)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {2683#(<= ~counter~0 4)} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {2683#(<= ~counter~0 4)} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,745 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2683#(<= ~counter~0 4)} {2683#(<= ~counter~0 4)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {2683#(<= ~counter~0 4)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {2683#(<= ~counter~0 4)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2708#(<= |main_#t~post5| 4)} is VALID [2022-04-27 20:15:56,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {2708#(<= |main_#t~post5| 4)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2567#false} is VALID [2022-04-27 20:15:56,746 INFO L272 TraceCheckUtils]: 46: Hoare triple {2567#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {2567#false} is VALID [2022-04-27 20:15:56,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {2567#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2567#false} is VALID [2022-04-27 20:15:56,746 INFO L290 TraceCheckUtils]: 48: Hoare triple {2567#false} [86] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2567#false} is VALID [2022-04-27 20:15:56,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {2567#false} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2567#false} is VALID [2022-04-27 20:15:56,746 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2567#false} {2567#false} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {2567#false} is VALID [2022-04-27 20:15:56,746 INFO L272 TraceCheckUtils]: 51: Hoare triple {2567#false} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2567#false} is VALID [2022-04-27 20:15:56,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {2567#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2567#false} is VALID [2022-04-27 20:15:56,747 INFO L290 TraceCheckUtils]: 53: Hoare triple {2567#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[] {2567#false} is VALID [2022-04-27 20:15:56,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {2567#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2567#false} is VALID [2022-04-27 20:15:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 20:15:56,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:15:56,960 INFO L290 TraceCheckUtils]: 54: Hoare triple {2567#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2567#false} is VALID [2022-04-27 20:15:56,960 INFO L290 TraceCheckUtils]: 53: Hoare triple {2567#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[] {2567#false} is VALID [2022-04-27 20:15:56,960 INFO L290 TraceCheckUtils]: 52: Hoare triple {2567#false} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2567#false} is VALID [2022-04-27 20:15:56,960 INFO L272 TraceCheckUtils]: 51: Hoare triple {2567#false} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2567#false} is VALID [2022-04-27 20:15:56,960 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2566#true} {2567#false} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {2567#false} is VALID [2022-04-27 20:15:56,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {2566#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2566#true} is VALID [2022-04-27 20:15:56,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {2566#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[] {2566#true} is VALID [2022-04-27 20:15:56,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {2566#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2566#true} is VALID [2022-04-27 20:15:56,961 INFO L272 TraceCheckUtils]: 46: Hoare triple {2567#false} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {2566#true} is VALID [2022-04-27 20:15:56,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {2708#(<= |main_#t~post5| 4)} [78] L28-1-->L28-4: Formula: (not (< |v_main_#t~post5_3| 5)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2567#false} is VALID [2022-04-27 20:15:56,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {2683#(<= ~counter~0 4)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2708#(<= |main_#t~post5| 4)} is VALID [2022-04-27 20:15:56,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {2683#(<= ~counter~0 4)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,963 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2566#true} {2683#(<= ~counter~0 4)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {2566#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2566#true} is VALID [2022-04-27 20:15:56,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {2566#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[] {2566#true} is VALID [2022-04-27 20:15:56,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {2566#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2566#true} is VALID [2022-04-27 20:15:56,963 INFO L272 TraceCheckUtils]: 38: Hoare triple {2683#(<= ~counter~0 4)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2566#true} is VALID [2022-04-27 20:15:56,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {2683#(<= ~counter~0 4)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {2658#(<= ~counter~0 3)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2683#(<= ~counter~0 4)} is VALID [2022-04-27 20:15:56,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {2658#(<= ~counter~0 3)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,965 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2566#true} {2658#(<= ~counter~0 3)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {2566#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2566#true} is VALID [2022-04-27 20:15:56,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {2566#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[] {2566#true} is VALID [2022-04-27 20:15:56,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {2566#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2566#true} is VALID [2022-04-27 20:15:56,965 INFO L272 TraceCheckUtils]: 30: Hoare triple {2658#(<= ~counter~0 3)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2566#true} is VALID [2022-04-27 20:15:56,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {2658#(<= ~counter~0 3)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {2633#(<= ~counter~0 2)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2658#(<= ~counter~0 3)} is VALID [2022-04-27 20:15:56,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {2633#(<= ~counter~0 2)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,971 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2566#true} {2633#(<= ~counter~0 2)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {2566#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2566#true} is VALID [2022-04-27 20:15:56,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {2566#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[] {2566#true} is VALID [2022-04-27 20:15:56,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {2566#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2566#true} is VALID [2022-04-27 20:15:56,971 INFO L272 TraceCheckUtils]: 22: Hoare triple {2633#(<= ~counter~0 2)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2566#true} is VALID [2022-04-27 20:15:56,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {2633#(<= ~counter~0 2)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {2608#(<= ~counter~0 1)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2633#(<= ~counter~0 2)} is VALID [2022-04-27 20:15:56,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {2608#(<= ~counter~0 1)} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,973 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2566#true} {2608#(<= ~counter~0 1)} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {2566#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2566#true} is VALID [2022-04-27 20:15:56,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {2566#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[] {2566#true} is VALID [2022-04-27 20:15:56,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {2566#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2566#true} is VALID [2022-04-27 20:15:56,973 INFO L272 TraceCheckUtils]: 14: Hoare triple {2608#(<= ~counter~0 1)} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2566#true} is VALID [2022-04-27 20:15:56,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#(<= ~counter~0 1)} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {2574#(<= ~counter~0 0)} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2608#(<= ~counter~0 1)} is VALID [2022-04-27 20:15:56,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {2574#(<= ~counter~0 0)} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2566#true} {2574#(<= ~counter~0 0)} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {2566#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2566#true} is VALID [2022-04-27 20:15:56,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {2566#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[] {2566#true} is VALID [2022-04-27 20:15:56,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {2566#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2566#true} is VALID [2022-04-27 20:15:56,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {2574#(<= ~counter~0 0)} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2566#true} is VALID [2022-04-27 20:15:56,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#(<= ~counter~0 0)} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#(<= ~counter~0 0)} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#(<= ~counter~0 0)} {2566#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#(<= ~counter~0 0)} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {2566#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2574#(<= ~counter~0 0)} is VALID [2022-04-27 20:15:56,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {2566#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2566#true} is VALID [2022-04-27 20:15:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 20:15:56,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:56,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680454552] [2022-04-27 20:15:56,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:15:56,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909921393] [2022-04-27 20:15:56,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909921393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 20:15:56,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 20:15:56,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-27 20:15:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544872516] [2022-04-27 20:15:56,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 20:15:56,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 55 [2022-04-27 20:15:56,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:56,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-27 20:15:57,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:57,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 20:15:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 20:15:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 20:15:57,020 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-27 20:15:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:57,153 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-27 20:15:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 20:15:57,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 55 [2022-04-27 20:15:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-27 20:15:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 20:15:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-27 20:15:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 20:15:57,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-27 20:15:57,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:57,203 INFO L225 Difference]: With dead ends: 60 [2022-04-27 20:15:57,203 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 20:15:57,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-27 20:15:57,204 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:57,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 87 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 20:15:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 20:15:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 20:15:57,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:57,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:57,207 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:57,208 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:57,209 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-27 20:15:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 20:15:57,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:57,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:57,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-27 20:15:57,209 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-27 20:15:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:57,211 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-27 20:15:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 20:15:57,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:57,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:57,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:57,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 20:15:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-27 20:15:57,212 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-27 20:15:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:57,212 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-27 20:15:57,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 7 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-27 20:15:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 20:15:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 20:15:57,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:57,213 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:57,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 20:15:57,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 20:15:57,432 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:57,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1029628710, now seen corresponding path program 4 times [2022-04-27 20:15:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:57,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129432271] [2022-04-27 20:15:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:57,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:57,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158994237] [2022-04-27 20:15:57,444 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 20:15:57,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:57,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:57,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:57,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 20:15:57,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 20:15:57,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 20:15:57,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 20:15:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 20:15:57,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 20:15:57,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {3151#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {3151#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3151#true} is VALID [2022-04-27 20:15:57,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {3151#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3151#true} {3151#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {3151#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {3151#true} [68] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {3151#true} is VALID [2022-04-27 20:15:57,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {3151#true} [70] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3151#true} is VALID [2022-04-27 20:15:57,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {3151#true} [72] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3151#true} is VALID [2022-04-27 20:15:57,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {3151#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[] {3151#true} is VALID [2022-04-27 20:15:57,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {3151#true} [80] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3151#true} {3151#true} [94] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= v_main_~k~0_8 256) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3151#true} is VALID [2022-04-27 20:15:57,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {3151#true} [71] L22-1-->L28-3: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {3189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:57,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {3189#(and (= main_~c~0 0) (= main_~y~0 0))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:57,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {3189#(and (= main_~c~0 0) (= main_~y~0 0))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:57,797 INFO L272 TraceCheckUtils]: 14: Hoare triple {3189#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3151#true} is VALID [2022-04-27 20:15:57,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {3151#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3151#true} is VALID [2022-04-27 20:15:57,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {3151#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[] {3151#true} is VALID [2022-04-27 20:15:57,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {3151#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,798 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3151#true} {3189#(and (= main_~c~0 0) (= main_~y~0 0))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 20:15:57,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {3189#(and (= main_~c~0 0) (= main_~y~0 0))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:15:57,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#(and (= main_~y~0 1) (= main_~c~0 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:15:57,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {3214#(and (= main_~y~0 1) (= main_~c~0 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:15:57,799 INFO L272 TraceCheckUtils]: 22: Hoare triple {3214#(and (= main_~y~0 1) (= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3151#true} is VALID [2022-04-27 20:15:57,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {3151#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3151#true} is VALID [2022-04-27 20:15:57,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {3151#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[] {3151#true} is VALID [2022-04-27 20:15:57,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {3151#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,800 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3151#true} {3214#(and (= main_~y~0 1) (= main_~c~0 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3214#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 20:15:57,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {3214#(and (= main_~y~0 1) (= main_~c~0 1))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3239#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 20:15:57,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {3239#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3239#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 20:15:57,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {3239#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3239#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 20:15:57,801 INFO L272 TraceCheckUtils]: 30: Hoare triple {3239#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3151#true} is VALID [2022-04-27 20:15:57,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {3151#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3151#true} is VALID [2022-04-27 20:15:57,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {3151#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[] {3151#true} is VALID [2022-04-27 20:15:57,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {3151#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,802 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3151#true} {3239#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3239#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 20:15:57,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {3239#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3264#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 20:15:57,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {3264#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3264#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 20:15:57,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {3264#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3264#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 20:15:57,803 INFO L272 TraceCheckUtils]: 38: Hoare triple {3264#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3151#true} is VALID [2022-04-27 20:15:57,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {3151#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3151#true} is VALID [2022-04-27 20:15:57,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {3151#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[] {3151#true} is VALID [2022-04-27 20:15:57,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {3151#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,804 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3151#true} {3264#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3264#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 20:15:57,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {3264#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} [88] L29-1-->L28-3: Formula: (and (< v_main_~c~0_5 v_main_~k~0_7) (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_7} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3289#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:15:57,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [74] L28-3-->L28-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3289#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:15:57,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {3289#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [79] L28-1-->L29: Formula: (< |v_main_#t~post5_5| 5) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3289#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:15:57,805 INFO L272 TraceCheckUtils]: 46: Hoare triple {3289#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3151#true} is VALID [2022-04-27 20:15:57,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {3151#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3151#true} is VALID [2022-04-27 20:15:57,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {3151#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[] {3151#true} is VALID [2022-04-27 20:15:57,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {3151#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,806 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3151#true} {3289#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [96] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3289#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 20:15:57,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {3289#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [87] L29-1-->L28-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_6)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {3314#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 20:15:57,807 INFO L272 TraceCheckUtils]: 52: Hoare triple {3314#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [77] L28-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {3151#true} is VALID [2022-04-27 20:15:57,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {3151#true} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3151#true} is VALID [2022-04-27 20:15:57,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {3151#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[] {3151#true} is VALID [2022-04-27 20:15:57,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {3151#true} [92] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3151#true} is VALID [2022-04-27 20:15:57,807 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3151#true} {3314#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [97] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 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] {3314#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 20:15:57,808 INFO L272 TraceCheckUtils]: 57: Hoare triple {3314#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [81] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~y~0_10 v_main_~k~0_9)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3333#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 20:15:57,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {3333#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3337#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 20:15:57,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {3337#(<= 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[] {3152#false} is VALID [2022-04-27 20:15:57,809 INFO L290 TraceCheckUtils]: 60: Hoare triple {3152#false} [90] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3152#false} is VALID [2022-04-27 20:15:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 20:15:57,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 20:15:58,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 20:15:58,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129432271] [2022-04-27 20:15:58,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 20:15:58,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158994237] [2022-04-27 20:15:58,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158994237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 20:15:58,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 20:15:58,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 20:15:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982454660] [2022-04-27 20:15:58,055 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 20:15:58,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 20:15:58,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 20:15:58,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 20:15:58,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:58,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 20:15:58,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 20:15:58,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 20:15:58,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 20:15:58,087 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 20:15:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:58,498 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-27 20:15:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 20:15:58,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 20:15:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 20:15:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 20:15:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-04-27 20:15:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 20:15:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-04-27 20:15:58,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 58 transitions. [2022-04-27 20:15:58,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 20:15:58,551 INFO L225 Difference]: With dead ends: 66 [2022-04-27 20:15:58,551 INFO L226 Difference]: Without dead ends: 62 [2022-04-27 20:15:58,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 20:15:58,552 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 20:15:58,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 269 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 20:15:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-27 20:15:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-27 20:15:58,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 20:15:58,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:58,555 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:58,555 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:58,556 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-27 20:15:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-27 20:15:58,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:58,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:58,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-27 20:15:58,557 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-27 20:15:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 20:15:58,558 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-27 20:15:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-27 20:15:58,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 20:15:58,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 20:15:58,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 20:15:58,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 20:15:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 20:15:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-27 20:15:58,562 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-27 20:15:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 20:15:58,563 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-27 20:15:58,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 20:15:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-27 20:15:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 20:15:58,563 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 20:15:58,564 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 20:15:58,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 20:15:58,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 20:15:58,765 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 20:15:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 20:15:58,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1636766017, now seen corresponding path program 2 times [2022-04-27 20:15:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 20:15:58,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788765810] [2022-04-27 20:15:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 20:15:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 20:15:58,783 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 20:15:58,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [284630200] [2022-04-27 20:15:58,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 20:15:58,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 20:15:58,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 20:15:58,799 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 20:15:58,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 20:15:59,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 20:15:59,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 20:15:59,178 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 20:15:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 20:15:59,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 20:15:59,254 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 20:15:59,254 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 20:15:59,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 20:15:59,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 20:15:59,458 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-04-27 20:15:59,461 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 20:15:59,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 08:15:59 BasicIcfg [2022-04-27 20:15:59,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 20:15:59,501 INFO L158 Benchmark]: Toolchain (without parser) took 10959.89ms. Allocated memory was 230.7MB in the beginning and 332.4MB in the end (delta: 101.7MB). Free memory was 178.1MB in the beginning and 276.0MB in the end (delta: -97.9MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. [2022-04-27 20:15:59,501 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 230.7MB. Free memory was 194.8MB in the beginning and 194.7MB in the end (delta: 84.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 20:15:59,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.80ms. Allocated memory is still 230.7MB. Free memory was 177.9MB in the beginning and 203.3MB in the end (delta: -25.5MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-04-27 20:15:59,501 INFO L158 Benchmark]: Boogie Preprocessor took 17.06ms. Allocated memory is still 230.7MB. Free memory was 203.3MB in the beginning and 201.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 20:15:59,502 INFO L158 Benchmark]: RCFGBuilder took 205.71ms. Allocated memory is still 230.7MB. Free memory was 201.5MB in the beginning and 190.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 20:15:59,502 INFO L158 Benchmark]: IcfgTransformer took 21.55ms. Allocated memory is still 230.7MB. Free memory was 190.0MB in the beginning and 188.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 20:15:59,503 INFO L158 Benchmark]: TraceAbstraction took 10538.90ms. Allocated memory was 230.7MB in the beginning and 332.4MB in the end (delta: 101.7MB). Free memory was 187.9MB in the beginning and 276.0MB in the end (delta: -88.1MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-27 20:15:59,504 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 230.7MB. Free memory was 194.8MB in the beginning and 194.7MB in the end (delta: 84.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.80ms. Allocated memory is still 230.7MB. Free memory was 177.9MB in the beginning and 203.3MB in the end (delta: -25.5MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.06ms. Allocated memory is still 230.7MB. Free memory was 203.3MB in the beginning and 201.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 205.71ms. Allocated memory is still 230.7MB. Free memory was 201.5MB in the beginning and 190.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 21.55ms. Allocated memory is still 230.7MB. Free memory was 190.0MB in the beginning and 188.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 10538.90ms. Allocated memory was 230.7MB in the beginning and 332.4MB in the end (delta: 101.7MB). Free memory was 187.9MB in the beginning and 276.0MB in the end (delta: -88.1MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; VAL [\old(counter)=8, counter=0] [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L22] CALL assume_abort_if_not(k <= 256) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L7] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L22] RET assume_abort_if_not(k <= 256) VAL [\old(counter)=0, counter=0, k=6] [L24] y = 0 [L25] x = 0 [L26] c = 0 VAL [\old(counter)=0, c=0, counter=0, k=6, x=0, y=0] [L28] EXPR counter++ VAL [\old(counter)=0, c=0, counter=1, counter++=0, k=6, x=0, y=0] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=0, counter=1, k=6, x=0, y=0] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=1, counter=1, k=6, x=1, y=1] [L28] EXPR counter++ VAL [\old(counter)=0, c=1, counter=2, counter++=1, k=6, x=1, y=1] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=1, counter=2, k=6, x=1, y=1] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=2, counter=2, k=6, x=33, y=2] [L28] EXPR counter++ VAL [\old(counter)=0, c=2, counter=3, counter++=2, k=6, x=33, y=2] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=2, counter=3, k=6, x=33, y=2] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=3, counter=3, k=6, x=276, y=3] [L28] EXPR counter++ VAL [\old(counter)=0, c=3, counter=4, counter++=3, k=6, x=276, y=3] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=3, counter=4, k=6, x=276, y=3] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=4, counter=4, k=6, x=1300, y=4] [L28] EXPR counter++ VAL [\old(counter)=0, c=4, counter=5, counter++=4, k=6, x=1300, y=4] [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=4, counter=5, k=6, x=1300, y=4] [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x VAL [\old(counter)=0, c=5, counter=5, k=6, x=4425, y=5] [L28] EXPR counter++ VAL [\old(counter)=0, c=5, counter=6, counter++=5, k=6, x=4425, y=5] [L28] COND FALSE !(counter++<5) [L39] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L39] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) VAL [\old(counter)=0, c=5, counter=6, k=6, x=4425, y=5] [L40] CALL __VERIFIER_assert(k*y == y*y) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L10] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L12] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 1281 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 971 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 557 IncrementalHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 310 mSDtfsCounter, 557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 452 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=10, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 419 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 1589 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1084 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 259/434 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 20:15:59,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...